Parametrised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic.
Yasir MahmoodArne MeierPublished in: CoRR (2019)
Keyphrases
- model checking
- bounded model checking
- pspace complete
- cl pc
- coalition logic
- satisfiability problem
- temporal logic
- epistemic logic
- model checker
- verification method
- linear temporal logic
- np complete
- propositional logic
- alternating time temporal logic
- formal verification
- transition systems
- asynchronous circuits
- modal logic
- temporal properties
- computational complexity
- formal specification
- propositional theories
- decision procedures
- symbolic model checking
- automated verification
- multi valued
- computation tree logic
- formal methods
- ctl model update
- propositional formulas
- probabilistic logic
- timed automata
- multi agent systems
- decision problems
- logic programming
- reactive systems
- cnf formula
- logic programs
- concurrent systems
- linear time temporal logic
- belief revision
- deterministic finite automaton
- phase transition
- logical framework
- search algorithm