The craft of model making: PSPACE bounds for non-iterative modal logics

The methods used to establish PSPACE-bounds for modal logics can roughly be grouped into two classes: syntax driven methods establish that exhaustive proof search can be performed in polynomial space whereas semantic approaches directly construct shallow models. In this paper, we follow the latter approach and establish generic PSPACE-bounds for a large and heterogeneous class of modal logics in a coalgebraic framework. In particular, no complete axiomatisation of the logic under scrutiny is needed. This does not only complement our earlier, syntactic, approach conceptually, but also covers a wide variety of new examples which are difficult to harness by purely syntactic means. Apart from re-proving known complexity bounds for a large variety of structurally different logics, we apply our method to obtain previously unknown PSPACE-bounds for Elgesem's logic of agency and for graded modal logic over reflexive frames.

[1]  Ronald Fagin,et al.  Reasoning about knowledge and probability , 1988, JACM.

[2]  Xavier Parent,et al.  Conventional Signalling Acts and Conversation , 2003, Workshop on Agent Communication Languages.

[3]  David Lewis.  Intensional logics without interative axioms , 1974, J. Philos. Log..

[4]  Marc Pauly,et al.  A Modal Logic for Coalitional Power in Games , 2002, J. Log. Comput..

[5]  Guido Governatori,et al.  On the Axiomatisation of Elgesem's Logic of Agency and Ability , 2005, J. Philos. Log..

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

[7]  Stéphane Demri,et al.  Presburger Modal Logic Is PSPACE-Complete , 2006, IJCAR.

[8]  Corina Cîrstea,et al.  Modular Construction of Modal Logics , 2004, CONCUR.

[9]  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..

[10]  M. de Rijke,et al.  Modal Logic , 2001, Cambridge Tracts in Theoretical Computer Science.

[11]  Stephan Tobies.  PSPACE Reasoning for Graded Modal Logics , 2001, J. Log. Comput..

[12]  Diego Calvanese,et al.  The Description Logic Handbook , 2007 .

[13]  Laurence Cholvy,et al.  Ability in a Multi-agent Context: A Model in the Situation Calculus , 2005, CLIMA.

[14]  Eric Pacuit,et al.  Majority Logic , 2004, KR.

[15]  Dag Elgesem,et al.  The modal logic of agency , 1997 .

[16]  Maurizio Fattorosi-Barnaba,et al.  Graded modalities. I , 1985, Stud Logica.

[17]  Moshe Y. Vardi.  On the complexity of epistemic reasoning , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[18]  Michael Barr,et al.  Terminal Coalgebras in Well-Founded Set Theory , 1993, Theor. Comput. Sci..

[19]  Dirk Pattinson,et al.  Coalgebraic modal logic: soundness, completeness and decidability of local consequence , 2003, Theor. Comput. Sci..

[20]  Lutz Schröder,et al.  Expressivity of coalgebraic modal logic: The limits and beyond , 2008, Theor. Comput. Sci..

[21]  Alexander Kurz,et al.  Specifying Coalgebras with Modal Logic , 1998, CMCS.

[22]  Ronald Fagin,et al.  A logic for reasoning about probabilities , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[23]  Joseph Y. Halpern,et al.  Reasoning about Expectation , 2002, UAI.

[24]  Joseph Y. Halpern,et al.  A Logic for Reasoning about Upper Probabilities , 2001, UAI.

[25]  Lutz Schröder,et al.  A finite model construction for coalgebraic modal logic , 2006, J. Log. Algebraic Methods Program..

[26]  Christos H. Papadimitriou,et al.  On the complexity of integer programming , 1981, JACM.

[27]  Camilla Schwind,et al.  A sequent calculus and a theorem prover for standard conditional logics , 2007, TOCL.

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

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

[30]  Kit Fine,et al.  In so many possible worlds , 1972, Notre Dame J. Formal Log..