Parameterised complexity of model checking and satisfiability in propositional dependence logic.
Yasir MahmoodArne MeierPublished in: Ann. Math. Artif. Intell. (2022)
Keyphrases
- model checking
- bounded model checking
- pspace complete
- cl pc
- coalition logic
- satisfiability problem
- temporal logic
- model checker
- epistemic logic
- np complete
- formal verification
- verification method
- alternating time temporal logic
- propositional logic
- transition systems
- asynchronous circuits
- linear temporal logic
- computation tree logic
- temporal properties
- symbolic model checking
- formal specification
- automated verification
- computational complexity
- modal logic
- timed automata
- propositional formulas
- formal methods
- ctl model update
- linear time temporal logic
- propositional theories
- decision procedures
- logical framework
- sat problem
- constraint satisfaction problems
- np hard
- phase transition
- concurrent systems
- first order logic
- multi agent systems
- knowledge base