The Complexity of Model Checking for Propositional Default Logics.
Paolo LiberatoreMarco SchaerfPublished in: ECAI (1998)
Keyphrases
- model checking
- default logic
- pspace complete
- temporal logic
- modal logic
- autoepistemic logic
- nonmonotonic reasoning
- default theories
- epistemic logic
- logic programming
- default reasoning
- model checker
- formal verification
- symbolic model checking
- truth maintenance systems
- automated verification
- computation tree logic
- nonmonotonic logics
- finite state machines
- verification method
- formal specification
- bounded model checking
- formal methods
- fixed point
- minimal models
- propositional logic
- computational complexity
- coalition logic
- np complete
- logic programs
- cl pc
- knowledge base