Complexity Results for Modal Dependence Logic
- 9 March 2013
- journal article
- Published by Springer Nature in Studia Logica
- Vol. 101 (2) , 343-366
Abstract
No abstract availableKeywords
All Related Versions
This publication has 15 references indexed in Scilit:
- Generalized modal satisfiabilityJournal of Computer and System Sciences, 2010
- Model-theoretic and Computational Properties of Modal Dependence LogicJournal of Logic and Computation, 2009
- The Complexity of Satisfiability for Fragments of CTL and CTL⋆Electronic Notes in Theoretical Computer Science, 2008
- From IF to BISynthese, 2008
- The Complexity of Poor Man's LogicJournal of Logic and Computation, 2001
- Lower bounds for multiplayer noncooperative games of incomplete informationComputers & Mathematics with Applications, 2001
- The complexity of existential quantification in concept languagesArtificial Intelligence, 1992
- Informational Independence as a Semantical Phenomenon1989
- The Computational Complexity of Provability in Systems of Modal Propositional LogicSIAM Journal on Computing, 1977
- Complete sets and the polynomial-time hierarchyTheoretical Computer Science, 1976