Preservation of Stronger Equivalence in Unfold/Fold Logic Program Transformation.
Tadashi KawamuraTadashi KanamoriPublished in: Theor. Comput. Sci. (1990)
Keyphrases
- logic programs
- strong equivalence
- answer set semantics
- answer sets
- logic programming
- stable models
- fixpoint
- answer set programming
- normal logic programs
- background knowledge
- computational properties
- prolog programs
- inductive logic programming
- logic program updates
- general logic programs
- stable model semantics
- loop formulas
- transformation rules
- declarative semantics
- extended logic programs
- fixpoint semantics
- datalog programs
- propositional theories
- existentially quantified
- semantics for logic programs
- deductive databases