Non-termination Inference for Constraint Logic Programs.
Étienne PayetFrédéric MesnardPublished in: SAS (2004)
Keyphrases
- logic programs
- logic programming
- abductive reasoning
- answer sets
- answer set programming
- stable models
- fixpoint
- background knowledge
- normal logic programs
- inductive logic programming
- partial deduction
- prolog programs
- computational properties
- bayesian networks
- probabilistic inference
- strong equivalence
- term rewriting systems
- stable model semantics
- inference mechanism
- logic program updates
- autoepistemic logic
- classical logic
- answer set programs
- belief networks