The complexity of model checking for propositional default logics.
Paolo LiberatoreMarco SchaerfPublished in: Data Knowl. Eng. (2005)
Keyphrases
- model checking
- default logic
- pspace complete
- temporal logic
- modal logic
- autoepistemic logic
- default theories
- default reasoning
- nonmonotonic reasoning
- formal verification
- model checker
- automated verification
- formal specification
- symbolic model checking
- logic programming
- finite state machines
- bounded model checking
- truth maintenance systems
- nonmonotonic logics
- computation tree logic
- fixed point
- np complete
- verification method
- satisfiability problem
- decision problems
- coalition logic
- cl pc
- alternating time temporal logic
- minimal models
- expert systems
- causal graph
- propositional logic
- sufficient conditions
- general purpose
- computational complexity
- artificial intelligence