Proving Termination of Logic Programs by Transforming them into Equivalent Term Rewriting Systems.
Gianni AguzziU. ModiglianiPublished in: FSTTCS (1993)
Keyphrases
- term rewriting systems
- logic programs
- strong equivalence
- logic programming
- functional programs
- answer set programming
- answer sets
- fixpoint
- stable models
- inductive logic programming
- prolog programs
- normal logic programs
- partial deduction
- computational properties
- stable model semantics
- loop formulas
- horn clauses
- deductive databases
- logic program updates