Termination proofs for logic programs with tabling.
Sofie VerbaetenDanny De SchreyeKonstantinos SagonasPublished in: ACM Trans. Comput. Log. (2001)
Keyphrases
- logic programs
- logic programming
- answer set programming
- answer sets
- stable models
- fixpoint
- logic programming language
- inductive logic programming
- background knowledge
- partial deduction
- nonmonotonic reasoning
- deductive databases
- theorem proving
- theorem prover
- default logic
- stable model semantics
- computational properties
- prolog programs
- normal logic programs
- constraint logic programming
- horn clauses
- reasoning tasks
- term rewriting systems
- classical logic
- expressive power
- minimal models
- functional programs
- strong equivalence