A General Criterion for Avoiding Infinite Unfolding During Partial Deduction of Logic Programs.
Maurice BruynoogheDanny De SchreyeBern MartensPublished in: ISLP (1991)
Keyphrases
- partial deduction
- logic programs
- logic programming
- answer sets
- answer set programming
- stable models
- background knowledge
- fixpoint
- computational properties
- recursive programs
- refinement operators
- term rewriting systems
- counter examples
- prolog programs
- normal logic programs
- monotonicity constraints
- strong equivalence
- stable model semantics
- inductive logic programming
- high level