Complexity of Polyadic Boolean Modal Logics: Model Checking and Satisfiability.
Reijo JaakkolaPublished in: CSL (2023)
Keyphrases
- temporal logic
- model checking
- modal logic
- satisfiability problem
- pspace complete
- decision procedures
- epistemic logic
- bounded model checking
- computation tree logic
- model checker
- finite state
- inference rules
- formal verification
- formal specification
- finite state machines
- conjunctive normal form
- computational complexity
- verification method
- temporal properties
- nonmonotonic logics
- default logic
- symbolic model checking
- situation calculus
- automated verification
- formal methods
- transition systems
- boolean functions
- linear temporal logic
- alternating time temporal logic
- dynamic logic
- decision problems
- model theoretic
- planning domains