DL-PA and DCL-PC: model checking and satisfiability problem are indeed in PSPACE.
Philippe BalbianiAndreas HerzigFrançois SchwarzentruberNicolas TroquardPublished in: CoRR (2014)
Keyphrases
- satisfiability problem
- temporal logic
- model checking
- mazurkiewicz traces
- pspace complete
- description logics
- formal verification
- temporal properties
- finite state
- model checker
- modal logic
- computation tree logic
- sat problem
- formal specification
- expressive power
- np complete
- formal methods
- decision procedures
- epistemic logic
- verification method
- automated verification
- sat instances
- knowledge base
- computational complexity
- bounded model checking
- symbolic model checking
- max sat
- special case