A New Meta-complexity Theorem for Bottom-Up Logic Programs.
Harald GanzingerDavid A. McAllesterPublished in: IJCAR (2001)
Keyphrases
- logic programs
- logic programming
- answer set programming
- existentially quantified
- fixpoint
- answer sets
- stable models
- background knowledge
- magic sets
- computational properties
- normal logic programs
- partial deduction
- prolog programs
- computational complexity
- stable model semantics
- polynomial hierarchy
- strong equivalence
- inductive logic programming
- recursive programs
- horn clauses
- default logic
- semantics of logic programs