License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CSL.2018.30
URN: urn:nbn:de:0030-drops-96979
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/9697/
Go to the corresponding LIPIcs Volume Portal

Lück, Martin

Canonical Models and the Complexity of Modal Team Logic

pdf-format:
LIPIcs-CSL-2018-30.pdf (0.6 MB)

Abstract

We study modal team logic MTL, the team-semantical extension of classical modal logic 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 adapt the notion of canonical models for team semantics. By construction of such a model, we reduce the satisfiability problem of MTL to simple model checking. Afterwards, we show that this method is optimal in the sense that MTL-formulas can efficiently enforce canonicity.
Furthermore, to capture these results in terms of computational complexity, we introduce a non-elementary complexity class, TOWER(poly), and prove that the satisfiability and validity problem of MTL are complete for it. We also show that the fragments of MTL with bounded modal depth are complete for the levels of the elementary hierarchy (with polynomially many alternations).

BibTeX - Entry

@InProceedings{lck:LIPIcs:2018:9697,
  author =	{Martin L{\"u}ck},
  title =	{{Canonical Models and the Complexity of Modal Team Logic}},
  booktitle =	{27th EACSL Annual Conference on Computer Science Logic  (CSL 2018)},
  pages =	{30:1--30:23},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-088-0},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{119},
  editor =	{Dan Ghica and Achim Jung},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/9697},
  URN =		{urn:nbn:de:0030-drops-96979},
  doi =		{10.4230/LIPIcs.CSL.2018.30},
  annote =	{Keywords: team semantics, modal logic, complexity, satisfiability}
}

Keywords: team semantics, modal logic, complexity, satisfiability
Collection: 27th EACSL Annual Conference on Computer Science Logic (CSL 2018)
Issue Date: 2018
Date of publication: 29.08.2018

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI