Automated termination proofs for logic programs by term rewriting.
Peter Schneider-KampJürgen GieslAlexander SerebrenikRené ThiemannPublished in: ACM Trans. Comput. Log. (2009)
Keyphrases
- term rewriting
- logic programs
- theorem proving
- theorem prover
- rewrite systems
- logic programming
- answer sets
- inference rules
- stable models
- background knowledge
- answer set programming
- computational properties
- operational semantics
- first order logic
- fixpoint
- decision procedures
- inductive logic programming
- term rewriting systems
- partial deduction
- normal logic programs
- prolog programs
- strong equivalence
- probabilistic model
- stable model semantics
- database
- monotonicity constraints
- loop formulas
- function symbols
- logic program updates