A polynomial space construction of tree-like models for logics with local chains of modal connectives

Stéphane Demri (1, 2)

1 CNRS - Centre National de la Recherche Scientifique
2 LSV - Laboratoire Spécification et Vérification [Cachan]

The LA-logics ("logics with Local Agreement") are polymodal logics defined semantically such that at any world of a model, the sets of successors for the different accessibility relations can be linearly ordered and the accessibility relations are equivalence relations. In a previous work, we have shown that every LA-logic defined with a finite set of modal indices has an NP-complete satisfiability problem. In this paper, we introduce a class of LA-logics with a countably infinite set of modal indices and we show that the satisfiability problem is PSPACE-complete for every logic of such a class. The upper bound is shown by exhibiting a tree structure of the models. This allows us to establish a surprising correspondence between the modal depth of formulae and the number of occurrences of distinct modal connectives. More importantly, as a consequence, we can show the PSPACE-completeness of Gargov's logic DALLA and Nakamura's logic LGM restricted to modal indices that are rational numbers, for which the computational complexity characterization has been open until now. These logics are known to belong to the class of information logics and fuzzy modal logics, respectively.

Mots clés: local agreement; Ladner-like algorithm; modal logic; complexity; multimodal logic; PSPACE; inclusion; equivalence relation; small model property

Domaines: Informatique [cs]; Logique en informatique [cs.LO]

Stéphane Demri. A polynomial space construction of tree-like models for logics with local chains of modal connectives. Theoretical Computer Science, 2003, 300 (1-3), pp.235-258. ⟨10.1016/S0304-3975(02)00082-8⟩. ⟨hal-03194857⟩