2000 character limit reached
Complexity of the Model Checking problem for inquisitive propositional and modal logic (2403.14260v2)
Published 21 Mar 2024 in cs.LO and math.LO
Abstract: The aim of this paper is to study the complexity of the model checking problem MC for inquisitive propositional logic InqB and for inquisitive modal logic InqM, that is, the problem of deciding whether a given finite structure for the logic satisfies a given formula. In recent years, this problem has been thoroughly investigated for several variations of dependence and teams logics, systems closely related to inquisitive logic. Building upon some ideas presented by Yang, we prove that the model checking problems for InqB and InqM are both AP-complete.
- Ivano Ciardelli. Questions in logic. PhD thesis, Institute for Logic, Language and Computation, University of Amsterdam, 2016.
- Questions and dependency in intuitionistic logic. Notre Dame Journal of Formal Logic, 61(1):75–115, 2020.
- Inquisitive dynamic epistemic logic. Synthese, 192(6):1643–1687, 2015.
- Chapter 24 - model checking. In Alan Robinson and Andrei Voronkov, editors, Handbook of Automated Reasoning, Handbook of Automated Reasoning, pages 1635–1790. North-Holland, Amsterdam, 2001.
- Complexity of model checking for modal dependence logic. In Mária Bieliková, Gerhard Friedrich, Georg Gottlob, Stefan Katzenbeisser, and György Turán, editors, SOFSEM 2012: Theory and Practice of Computer Science, pages 226–237, Berlin, Heidelberg, 2012. Springer Berlin Heidelberg.
- Model checking for modal intuitionistic dependence logic. In Guram Bezhanishvili, Sebastian Löbner, Vincenzo Marra, and Frank Richter, editors, Logic, Language, and Computation, pages 231–256, Berlin, Heidelberg, 2013. Springer Berlin Heidelberg.
- Michael Sipser. Introduction to the Theory of Computation. Course Technology, Boston, MA, third edition, 2013.
- Moshe Y. Vardi. The complexity of relational query languages (extended abstract). In Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, STOC ’82, pages 137–146, New York, NY, USA, 1982. Association for Computing Machinery.
- Fan Yang. On extensions and variants of dependence logic: A study of intuitionistic connectives in the team semantics setting. PhD thesis, University of Helsinki, 2014.
- Max Zeuner. Model checking for inquisitive logic. Master Thesis, Ludwig Maximilian University, 2020.