Complexity of Model Checking for Modal Dependence Logic
Authors:
- 1 January 2012
- book chapter
- Published by Springer Nature
- p. 226-237
Abstract
No abstract availableKeywords
All Related Versions
This publication has 7 references indexed in Scilit:
- Model Checking CTL is Almost Always Inherently SequentialLogical Methods in Computer Science, 2011
- Generalized modal satisfiabilityJournal of Computer and System Sciences, 2010
- Complexity Results for Modal Dependence Logic2010
- Model-theoretic and Computational Properties of Modal Dependence LogicJournal of Logic and Computation, 2009
- Dependence Logic2007
- Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Transactions on Programming Languages and Systems, 1986
- Satisfiability problems for propositional calculiTheory of Computing Systems, 1979