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

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.

[1]  Michael A. Taitslin,et al.  A Logic for Data Description , 1989, Logic at Botik.

[2]  Franz Baader,et al.  An Overview of Tableau Algorithms for Description Logics , 2001, Stud Logica.

[3]  Joseph Y. Halpern,et al.  A Guide to Completeness and Complexity for Modal Logics of Knowledge and Belief , 1992, Artif. Intell..

[4]  Valentin Goranko,et al.  Using the Universal Modality: Gains and Questions , 1992, J. Log. Comput..

[5]  Stéphane Demri,et al.  A Class of Decidable Information Logics , 1998, Theor. Comput. Sci..

[6]  Heinrich Wansing,et al.  Proof Theory of Modal Logic , 1996 .

[7]  Stéphane Demri,et al.  Logical Analysis of Indiscernibility , 1998 .

[8]  Philippe Balbiani.  Emptiness Relations in Property Systems , 2001, RelMiCS.

[9]  Richard E. Ladner,et al.  Propositional Dynamic Logic of Regular Programs , 1979, J. Comput. Syst. Sci..

[10]  I-Peng Lin,et al.  The Computational Complexity of the Satisfiability of Modal Horn Clauses for Modal Propositional Logics , 1994, Theor. Comput. Sci..

[11]  Akira Nakamura.  On a Logic Based on Graded Modalities , 1993 .

[12]  Pierre Wolper,et al.  Reasoning About Infinite Computations , 1994, Inf. Comput..

[13]  M. de Rijke,et al.  JFAK. Essays Dedicated to Johan van Benthem on the occasion of his 50th Birthday , 1999 .

[14]  Max J. Cresswell,et al.  A New Introduction to Modal Logic , 1998 .

[15]  A. Prasad Sistla,et al.  On model checking for the µ-calculus and its fragments , 2001, Theor. Comput. Sci..

[16]  Philippe Balbiani.  A Modal Logic for Data Analysis , 1996, MFCS.

[17]  Richard E. Ladner,et al.  The Computational Complexity of Provability in Systems of Modal Propositional Logic , 1977, SIAM J. Comput..

[18]  Janusz Zalewski,et al.  Rough sets: Theoretical aspects of reasoning about data , 1996 .

[19]  Richard Spencer-Smith,et al.  Modal Logic , 2007 .

[20]  Philippe Schnoebelen,et al.  The Complexity of Propositional Linear Temporal Logics in Simple Cases , 1998, Inf. Comput..

[21]  W. van der Hoek,et al.  A Complete Epistemic Logic for Multiple Agents: Combining Distributed and Common Knowledge , 1996 .

[22]  Luis Fariñas del Cerro,et al.  DAL - A Logic for Data Analysis , 1985, Theor. Comput. Sci..

[23]  Edith Spaan.  The Complexity of Propositional Tense Logics , 1993 .

[24]  Edith Hemaspaandra,et al.  The Price of Universality , 1996, Notre Dame J. Formal Log..

[25]  Philippe Balbiani,et al.  A hierarchy of modal logics with relative accessibility relations , 1999, J. Appl. Non Class. Logics.

[26]  M. de Rijke,et al.  Advances in Modal Logic , Volume 3 , 2004 .

[27]  Wiebe van der Hoek,et al.  A Postscript to a Completeness Proof for Johan , 1999 .

[28]  Stéphane Demri,et al.  The Nondeterministic Information Logic NIL is PSPACE-complete , 2000, Fundam. Informaticae.

[29]  Gert Smolka,et al.  Attributive Concept Descriptions with Complements , 1991, Artif. Intell..

[30]  Fabio Massacci,et al.  Single Step Tableaux for Modal Logics , 2000, Journal of Automated Reasoning.

[31]  Joseph Y. Halpern.  The Effect of Bounding the Number of Primitive Propositions and the Depth of Nesting on the Complexity of Modal Logic , 1995, Artif. Intell..

[32]  Grigori Mints,et al.  Gentzen-type systems and resolution rules. Part I. Propositional logic , 1990, Conference on Computer Logic.

[33]  Moshe Y. Vardi.  Reasoning about The Past with Two-Way Automata , 1998, ICALP.

[34]  Luca Viganò,et al.  Labelled non-classical logics , 2000 .

[35]  Erich Grädel,et al.  Why are Modal Logics so Robustly Decidable? , 2001, Bull. EATCS.

[36]  Werner Nutt,et al.  The Complexity of Concept Languages , 1997, KR.

[37]  Stéphane Demri,et al.  Incomplete Information: Structure, Inference, Complexity , 2002, Monographs in Theoretical Computer Science An EATCS Series.

[38]  Larry J. Stockmeyer,et al.  The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[39]  Henrik Sahlqvist.  Completeness and Correspondence in the First and Second Order Semantics for Modal Logic , 1975 .

[40]  M. Kracht.  Power and Weakness of the Modal Display Calculus , 1996 .

[41]  Pierre Wolper,et al.  Automata theoretic techniques for modal logics of programs: (Extended abstract) , 1984, STOC '84.

[42]  J. Kacprzyk,et al.  Incomplete Information: Rough Set Analysis , 1997 .