Verifying the Modal Logic Cube Is an Easy Task (For Higher-Order Automated Reasoners)

Prominent logics, including quantified multimodal logics, can be elegantly embedded in simple type theory (classical higher-order logic). Furthermore, off-the-shelf reasoning systems for simple type type theory exist that can be uniformly employed for reasoning within and about embedded logics. In this paper we focus on reasoning about modal logics and exploit our framework for the automated verification of inclusion and equivalence relations between them. Related work has applied first-order automated theorem provers for the task. Our solution achieves significant improvements, most notably, with respect to elegance and simplicity of the problem encodings as well as with respect to automation performance.

[1]  Geoff Sutcliffe,et al.  TPTP, TSTP, CASC, etc , 2007, CSR.

[2]  Maarten Marx,et al.  Tableaux for Quantified Hybrid Logic , 2002, TABLEAUX.

[3]  Geoff Sutcliffe.  The TPTP Problem Library and Associated Infrastructure , 2009, Journal of Automated Reasoning.

[4]  Christoph Benzmüller,et al.  Combining Logics in Simple Type Theory , 2010, CLIMA.

[5]  Leon Henkin,et al.  Completeness in the theory of types , 1950, Journal of Symbolic Logic.

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

[7]  Torben Braüner,et al.  Natural Deduction for First-Order Hybrid Logic , 2005, J. Log. Lang. Inf..

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

[9]  Lawrence C. Paulson,et al.  Multimodal and intuitionistic logics in simple type theory , 2010, Log. J. IGPL.

[10]  R. Goldblatt.  Logics of Time and Computation , 1987 .

[11]  Stephan Schulz,et al.  E - a brainiac theorem prover , 2002, AI Commun..

[12]  Lawrence Charles Paulson,et al.  Isabelle/HOL: A Proof Assistant for Higher-Order Logic , 2002 .

[13]  Geoff Sutcliffe,et al.  THF0 - The Core of the TPTP Language for Higher-Order Logic , 2008, IJCAR.

[14]  Tjark Weber,et al.  SAT-based finite model generation for higher-order logic , 2008 .

[15]  Gert Smolka,et al.  Terminating Tableau Systems for Hybrid Logic with Difference and Converse , 2009, J. Log. Lang. Inf..

[16]  Peter B. Andrews.  An introduction to mathematical logic and type theory - to truth through proof , 1986, Computer science and applied mathematics.

[17]  Chad E. Brown,et al.  Analytic Tableaux for Higher-Order Logic with Choice , 2010, Journal of Automated Reasoning.

[18]  Peter B. Andrews,et al.  TPS: A hybrid automatic-interactive system for developing proofs , 2006, J. Appl. Log..

[19]  Alonzo Church,et al.  A formulation of the simple theory of types , 1940, Journal of Symbolic Logic.

[20]  Geoff Sutcliffe,et al.  Automated Reasoning in Higher-Order Logic using the TPTP THF Infrastructure , 2010, J. Formaliz. Reason..

[21]  Lawrence C. Paulson,et al.  LEO-II - A Cooperative Automatic Theorem Prover for Classical Higher-Order Logic (System Description) , 2008, IJCAR.

[22]  Christoph Benzmüller,et al.  Higher-order semantics and extensionality , 2004, Journal of Symbolic Logic.

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

[24]  Melvin Fitting,et al.  Interpolation for first order S5 , 2002, Journal of Symbolic Logic.

[25]  Peter B. Andrews.  General Models, Descriptions, and Choice in Type Theory , 1972, J. Symb. Log..

[26]  Tobias Nipkow,et al.  Nitpick: A Counterexample Generator for Higher-Order Logic Based on a Relational Model Finder , 2010, ITP.

[27]  Geoff Sutcliffe,et al.  Solving the $100 modal logic challenge , 2009, J. Appl. Log..

[28]  Peter B. Andrews.  General models and extensionality , 1972, Journal of Symbolic Logic.