A non-termination criterion for binary constraint logic programs.
Étienne PayetFrédéric MesnardPublished in: Theory Pract. Log. Program. (2009)
Keyphrases
- logic programs
- logic programming
- answer sets
- background knowledge
- answer set programming
- fixpoint
- stable models
- partial deduction
- computational properties
- inductive logic programming
- normal logic programs
- logic program updates
- term rewriting systems
- stable model semantics
- horn clauses
- expert systems
- linear constraints
- data model
- functional programs
- strong equivalence
- existentially quantified
- nonmonotonic reasoning
- description logics