@inproceedings{64f3ec23dc834069bff8c841a94fecd4,
title = "Complexity of Polyadic Boolean Modal Logics: Model Checking and Satisfiability",
abstract = "We study the computational complexity of model checking and satisfiability problems of polyadic modal logics extended with permutations and Boolean operators on accessibility relations. First, we show that the combined complexity of the model checking problem for the resulting logic is PTime-complete. Secondly, we show that the satisfiability problem of polyadic modal logic extended with negation on accessibility relations is ExpTime-complete. Finally, we show that the satisfiability problem of polyadic modal logic with permutations and Boolean operators on accessibility relations is ExpTime-complete, under the assumption that both the number of accessibility relations that can be used and their arities are bounded by a constant. If NExpTime is not contained in ExpTime, then this assumption is necessary, since already the satisfiability problem of modal logic extended with Boolean operators on accessibility relations is NExpTime-hard.",
keywords = "Boolean modal logics, Model checking, Polyadic modal logics, Satisfiability",
author = "Reijo Jaakkola",
note = "Publisher Copyright: {\textcopyright} Reijo Jaakkola; licensed under Creative Commons License CC-BY 4.0.; Annual Conference on Computer Science Logic ; Conference date: 13-02-2023 Through 16-02-2023",
year = "2023",
month = feb,
day = "1",
doi = "10.4230/LIPIcs.CSL.2023.26",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl - Leibniz-Zentrum f{\"u}r Informatik",
editor = "Bartek Klin and Elaine Pimentel",
booktitle = "31st EACSL Annual Conference on Computer Science Logic, CSL 2023",
}