On the counting complexity of propositional circumscription.
Arnaud DurandMiki HermannPublished in: Inf. Process. Lett. (2008)
Keyphrases
- default logic
- disjunctive logic programming
- polynomial hierarchy
- logic programs
- propositional logic
- general logic programs
- loop formulas
- first order logic
- computational complexity
- logic programs with negation
- answer sets
- theorem prover
- multi valued
- description logics
- worst case
- knowledge representation
- knowledge base