On proving left termination of constraint logic programs.
Frédéric MesnardSalvatore RuggieriPublished in: ACM Trans. Comput. Log. (2003)
Keyphrases
- logic programs
- logic programming
- answer sets
- term rewrite systems
- stable models
- fixpoint
- answer set programming
- background knowledge
- prolog programs
- inductive logic programming
- partial deduction
- normal logic programs
- strong equivalence
- computational properties
- stable model semantics
- horn clauses
- answer set semantics
- term rewriting systems
- logic program updates
- recursive programs
- existentially quantified
- equality constraints
- loop formulas
- autoepistemic logic
- reasoning tasks
- constraint programming
- deductive databases