Automated Termination Proofs for Logic Programs by Term Rewriting
Peter Schneider-KampJürgen GieslAlexander SerebrenikRené ThiemannPublished in: CoRR (2008)
Keyphrases
- term rewriting
- logic programs
- theorem proving
- theorem prover
- rewrite systems
- logic programming
- first order logic
- stable models
- background knowledge
- answer sets
- answer set programming
- operational semantics
- fixpoint
- inference rules
- normal logic programs
- decision procedures
- partial deduction
- term rewriting systems
- prolog programs
- computational properties
- inductive logic programming
- stable model semantics
- function symbols
- minimal models
- semantics of logic programs
- recursive programs
- propositional theories
- normal form
- autoepistemic logic
- horn clauses