On the Complexity of Model Checking for Propositional Default Logics: New Results and Tractable Cases.
Robert BaumgartnerGeorg GottlobPublished in: IJCAI (1999)
Keyphrases
- model checking
- tractable cases
- default logic
- temporal logic
- modal logic
- pspace complete
- autoepistemic logic
- default theories
- nonmonotonic reasoning
- default reasoning
- logic programming
- formal specification
- causal models
- finite state machines
- fixed point
- planning domains
- classical logic
- polynomial size
- satisfiability problem
- bounded treewidth
- constraint satisfaction