Abstract Properties and Computational Complexity of Semantics for Disjunctive Logic Programs.
Jürgen DixMartin MüllerPublished in: Structural Complexity and Recursion-theoretic methods in Logic-Programming (1992)
Keyphrases
- disjunctive logic programs
- computational complexity
- disjunctive logic programming
- logic programming
- logic programs
- stable model semantics
- desirable properties
- stable models
- default logic
- answer set programming
- high level
- reasoning tasks
- artificial intelligence
- np complete
- formal semantics
- knowledge representation
- model theoretic
- special case
- polynomial hierarchy
- lower bound