Proving Properties of Constraint Logic Programs by Eliminating Existential Variables.
Alberto PettorossiMaurizio ProiettiValerio SenniPublished in: ICLP (2006)
Keyphrases
- logic programs
- existentially quantified
- logic programming
- stable models
- answer sets
- fixpoint
- answer set programming
- universally quantified
- background knowledge
- normal logic programs
- function symbols
- computational properties
- partial deduction
- term rewriting systems
- stable model semantics
- prolog programs
- inductive logic programming
- functional programs
- answer set semantics
- logic program updates
- strong equivalence
- propositional theories
- horn clauses
- linear constraints