A Non-Termination Criterion for Binary Constraint Logic Programs
Étienne PayetFrédéric MesnardPublished in: CoRR (2008)
Keyphrases
- logic programs
- logic programming
- answer sets
- fixpoint
- stable models
- answer set programming
- background knowledge
- partial deduction
- normal logic programs
- linear constraints
- inductive logic programming
- prolog programs
- computational properties
- existentially quantified
- stable model semantics
- logic program updates
- loop formulas
- answer set semantics
- term rewriting systems
- equality constraints
- decision problems
- functional programs
- strong equivalence
- constraint satisfaction
- semantic web
- query language
- knowledge base