Propositional default logics made easier: computational complexity of model checking.
Robert BaumgartnerGeorg GottlobPublished in: Theor. Comput. Sci. (2002)
Keyphrases
- default logic
- model checking
- computational complexity
- temporal logic
- modal logic
- autoepistemic logic
- default reasoning
- default theories
- logic programming
- model checker
- nonmonotonic logics
- nonmonotonic reasoning
- formal specification
- computation tree logic
- formal verification
- np complete
- symbolic model checking
- truth maintenance systems
- pspace complete
- decision problems
- finite state machines
- epistemic logic
- fixed point
- formal methods
- classical logic
- bounded model checking
- verification method
- inference rules
- machine learning
- artificial intelligence
- np hard
- model theoretic
- general purpose
- decision procedures
- satisfiability problem