A Folding Rule for Eliminating Existential Variables from Constraint Logic Programs.
Valerio SenniAlberto PettorossiMaurizio ProiettiPublished in: Fundam. Informaticae (2009)
Keyphrases
- existentially quantified
- logic programs
- logic programming
- answer sets
- computational properties
- background knowledge
- partial deduction
- fixpoint
- stable models
- answer set programming
- universally quantified
- answer set semantics
- prolog programs
- normal logic programs
- function symbols
- recursive programs
- inductive logic programming
- term rewriting systems
- minimal models
- fixpoint semantics
- linear constraints
- nonmonotonic reasoning