Tractable model checking for fragments of higher-order coalition logic.
Patrick DohertyBarbara Dunin-KepliczAndrzej SzalasPublished in: AAMAS (2011)
Keyphrases
- coalition logic
- model checking
- temporal logic
- pspace complete
- formal verification
- model checker
- cl pc
- finite state
- automated verification
- formal specification
- bounded model checking
- symbolic model checking
- np hard
- computational complexity
- np complete
- epistemic logic
- verification method
- formal methods
- artificial intelligence
- computation tree logic
- logical framework
- planning domains
- binary decision diagrams
- modal logic
- special case