Complexity of Polyadic Boolean Modal Logics: Model Checking and Satisfiability.
Reijo JaakkolaPublished in: CoRR (2022)
Keyphrases
- temporal logic
- model checking
- modal logic
- satisfiability problem
- decision procedures
- pspace complete
- epistemic logic
- bounded model checking
- model checker
- inference rules
- computation tree logic
- automated verification
- formal specification
- computational complexity
- linear temporal logic
- temporal properties
- verification method
- conjunctive normal form
- formal verification
- np complete
- finite state machines
- nonmonotonic logics
- symbolic model checking
- finite state
- formal methods
- multi agent systems
- transition systems
- situation calculus
- default logic
- phase transition
- sequent calculus
- boolean formula
- logical framework
- modal operators
- decision problems
- binary decision diagrams