Tight, Consistent and Computable Completions for Unrestricted Logic Programs.
Mark WallacePublished in: J. Log. Program. (1993)
Keyphrases
- logic programs
- logic programming
- answer sets
- answer set programming
- stable models
- fixpoint
- lower bound
- normal logic programs
- partial deduction
- background knowledge
- term rewriting systems
- logic program updates
- inductive logic programming
- computational properties
- prolog programs
- strong equivalence
- horn clauses
- nonmonotonic reasoning
- monotonicity constraints