Canonical Models and the Complexity of Modal Team Logic

We study modal team logic MTL, the team-semantical extension of modal logic ML closed under Boolean negation. Its fragments, such as modal dependence, independence, and inclusion logic, are well-understood. However, due to the unrestricted Boolean negation, the satisfiability problem of full MTL has been notoriously resistant to a complexity theoretical classification. In our approach, we introduce the notion of canonical models into the team-semantical setting. By construction of such a model, we reduce the satisfiability problem of MTL to simple model checking. Afterwards, we show that this approach is optimal in the sense that MTL-formulas can efficiently enforce canonicity. Furthermore, to capture these results in terms of complexity, we introduce a non-elementary complexity class, TOWER(poly), and prove that it contains satisfiability and validity of MTL as complete problems. We also prove that the fragments of MTL with bounded modal depth are complete for the levels of the elementary hierarchy (with polynomially many alternations).

[1]  Merlijn Sevenster,et al.  Model-theoretic and Computational Properties of Modal Dependence Logic , 2009, J. Log. Comput..

[2]  Jonni Virtema,et al.  Complexity of Propositional Logics in Team Semantic , 2018, TOCL.

[3]  Lauri Hella,et al.  Modal Inclusion Logic: Being Lax is Simpler than Being Strict , 2015, MFCS.

[4]  Pietro Galliani.  Upwards closed dependencies in team semantics , 2015, Inf. Comput..

[5]  Fan Yang,et al.  Propositional logics of dependence , 2014, Ann. Pure Appl. Log..

[6]  Jan Strejcek,et al.  On the Complexity of the Quantified Bit-Vector Arithmetic with Binary Encoded Bit-Widths , 2016, ArXiv.

[7]  Pietro Galliani,et al.  Inclusion and exclusion dependencies in team semantics - On some logics of imperfect information , 2011, Ann. Pure Appl. Log..

[8]  Martin Lück,et al.  Axiomatizations for Propositional and Modal Team Logic , 2016, CSL.

[9]  J. Hintikka,et al.  Informational Independence as a Semantical Phenomenon , 1989 .

[10]  Jonni Virtema.  Complexity of validity for propositional dependence logics , 2017, Inf. Comput..

[11]  Martin Lück,et al.  The Power of the Filtration Technique for Modal Logics with Team Semantics , 2017, CSL.

[12]  Sylvain Schmitz,et al.  Complexity Hierarchies beyond Elementary , 2013, TOCT.

[13]  M. de Rijke,et al.  Modal Logic , 2001, Cambridge Tracts in Theoretical Computer Science.

[14]  Lauri Hella,et al.  The expressive power of modal logic with inclusion atoms , 2015, GandALF.

[15]  Julian-Steffen Müller,et al.  A Van Benthem Theorem for Modal Team Semantics , 2015, CSL.

[16]  Jouko Vnnen,et al.  Dependence Logic: A New Approach to Independence Friendly Logic (London Mathematical Society Student Texts) , 2007 .

[17]  Erich Grädel,et al.  Dependence and Independence , 2012, Stud Logica.

[18]  Wilfrid Hodges,et al.  Compositional Semantics for a Language of Imperfect Information , 1997, Log. J. IGPL.

[19]  Miika Hannula.  Validity and Entailment in Modal and Propositional Dependence Logics , 2017, CSL.

[20]  Heribert Vollmer,et al.  Complexity Results for Modal Dependence Logic , 2010, Studia Logica.

[21]  Jonni Virtema,et al.  On Quantified Propositional Logics and the Exponential Time Hierarchy , 2016, GandALF.

[22]  Jonni Virtema,et al.  Complexity of Propositional Independence and Inclusion Logic , 2015, MFCS.

[23]  Julian-Steffen Müller,et al.  Modal Independence Logic , 2014, Advances in Modal Logic.

[24]  Lauri Hella,et al.  The Expressive Power of Modal Dependence Logic , 2014, Advances in Modal Logic.

[25]  Arne Meier,et al.  A Team Based Variant of CTL , 2015, 2015 22nd International Symposium on Temporal Representation and Reasoning (TIME).

[26]  J. Väänänen,et al.  Modal Dependence Logic , 2008 .

[27]  Julian-Steffen Müller.  Satisfiability and model checking in team based logics , 2014 .

[28]  Heribert Vollmer,et al.  Expressivity and Complexity of Dependence Logic , 2016, Dependence Logic.