Preserving of Stronger Equivalence in Unfold/Fold Logic Program Transformation.
Tadashi KawamuraTadashi KanamoriPublished in: FGCS (1988)
Keyphrases
- logic programs
- strong equivalence
- answer set semantics
- logic programming
- answer sets
- stable models
- answer set programming
- normal logic programs
- fixpoint
- background knowledge
- inside outside algorithm
- logic program updates
- inductive logic programming
- fixpoint semantics
- prolog programs
- computational properties
- horn clauses
- extended logic programs
- datalog programs
- loop formulas
- general logic programs
- stable model semantics
- reasoning tasks
- model theoretic
- nonmonotonic reasoning
- transformation rules
- counter examples
- existentially quantified
- deductive databases