Optimal Tableau Algorithms for Coalgebraic Logics

Deciding whether a modal formula is satisfiable with respect to a given set of (global) assumptions is a question of fundamental importance in applications of logic in computer science. Tableau methods have proved extremely versatile for solving this problem for many different individual logics but they typically do not meet the known complexity bounds for the logics in question. Recently, it has been shown that optimality can be obtained for some logics while retaining practicality by using a technique called “global caching”. Here, we show that global caching is applicable to all logics that can be equipped with coalgebraic semantics, for example, classical modal logic, graded modal logic, probabilistic modal logic and coalition logic. In particular, the coalgebraic approach also covers logics that combine these various features. We thus show that global caching is a widely applicable technique and also provide foundations for optimal tableau algorithms that uniformly apply to a large class of modal logics.

[1]  Ian Horrocks,et al.  Optimizing Description Logic Subsumption , 1999, J. Log. Comput..

[2]  René Mazala,et al.  Infinite Games , 2001, Automata, Logics, and Infinite Games.

[3]  Yde Venema,et al.  Dynamic Logic by David Harel, Dexter Kozen and Jerzy Tiuryn. The MIT Press, Cambridge, Massachusetts. Hardback: ISBN 0–262–08289–6, $50, xv + 459 pages , 2002, Theory and Practice of Logic Programming.

[4]  Dirk Pattinson,et al.  Admissibility of Cut in Coalgebraic Logics , 2008, CMCS.

[5]  Rajeev Goré,et al.  An Experimental Evaluation of Global Caching for (System Description) , 2008, IJCAR.

[6]  Rajeev Goré,et al.  Tableau Methods for Modal and Temporal Logics , 1999 .

[7]  Dirk Pattinson,et al.  PSPACE Bounds for Rank-1 Modal Logics , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[8]  Ian Horrocks,et al.  FaCT++ Description Logic Reasoner: System Description , 2006, IJCAR.

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

[10]  Corina Cîrstea,et al.  Modular construction of complete coalgebraic logics , 2007, Theor. Comput. Sci..

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

[12]  Alex K. Simpson,et al.  Computational Adequacy in an Elementary Topos , 1998, CSL.

[13]  Colin Stirling,et al.  Modal and temporal logics , 1993, LICS 1993.

[14]  Volker Haarslev,et al.  RACER System Description , 2001, IJCAR.

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

[16]  Dirk Pattinson,et al.  EXPTIME Tableaux for the Coalgebraic µ-Calculus , 2009, CSL.

[17]  Thomas Wilke,et al.  Automata logics, and infinite games: a guide to current research , 2002 .

[18]  Thomas Wilke,et al.  Automata Logics, and Infinite Games , 2002, Lecture Notes in Computer Science.

[19]  Dirk Pattinson,et al.  Nominals for Everyone , 2009, IJCAI.

[20]  Dirk Pattinson,et al.  Modular Algorithms for Heterogeneous Modal Logics , 2007, ICALP.

[21]  Roy Dyckhoff.  Automated Reasoning with Analytic Tableaux and Related Methods , 2000, Lecture Notes in Computer Science.

[22]  Jerzy Tiuryn,et al.  Dynamic logic , 2001, SIGA.

[23]  Diego Calvanese,et al.  The Description Logic Handbook: Theory, Implementation, and Applications , 2003, Description Logic Handbook.

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

[25]  Larry Wos,et al.  What Is Automated Reasoning? , 1987, J. Autom. Reason..

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

[27]  Corina Cîrstea,et al.  EXPTIME Tableaux for the Coalgebraic µ-Calculus , 2009, CSL.

[28]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[29]  Corina Cîrstea,et al.  A compositional approach to defining logics for coalgebras , 2004, Theor. Comput. Sci..

[30]  Francesco M. Donini,et al.  Exptime Tableaux for ALC , 2000, Description Logics.

[31]  Rajeev Goré,et al.  EXPTIME tableaux for ALC using sound global caching , 2007 .

[32]  D. Gabbay,et al.  Handbook of tableau methods , 1999 .

[33]  Rajeev Goré,et al.  Sound Global State Caching for ALC with Inverse Roles , 2009, TABLEAUX.

[34]  Ronald Fagin,et al.  Reasoning about knowledge , 1995 .

[35]  Rajeev Goré,et al.  EXPTIME Tableaux with Global Caching for Description Logics with Transitive Roles, Inverse Roles and Role Hierarchies , 2007, TABLEAUX.

[36]  Lutz Schröder.  A Finite Model Construction for Coalgebraic Modal Logic , 2006, FoSSaCS.

[37]  Aviad Heifetz,et al.  Probability Logic for Type Spaces , 2001, Games Econ. Behav..