Bidirectional Decision Procedures for the Intuitionistic Propositional Modal Logic IS4

We present a multi-context focused sequent calculus whose derivations are in bijective correspondence with normal natural deductions in the propositional fragment of the intuitionistic modal logic IS4 . This calculus, suitable for the enumeration of normal proofs, is the starting point for the development of a sequent calculus-based bidirectional decision procedure for propositional IS4 . In this system, relevant derived inference rules are constructed in a forward direction prior to proof search, while derivations constructed using these derived rules are searched over in a backward direction. We also present a variant which searches directly over normal natural deductions. Experimental results show that on most problems, the bidirectional prover is competitive with both conventional backward provers using loop-detection and inverse method provers, significantly outperforming them in a number of cases.

[1]  J. Girard,et al.  Proofs and types , 1989 .

[2]  JEAN-MARC ANDREOLI,et al.  Logic Programming with Focusing Proofs in Linear Logic , 1992, J. Log. Comput..

[3]  Frank Pfenning,et al.  A modal analysis of staged computation , 1996, POPL '96.

[4]  Frank Pfenning,et al.  Contextual modal type theory , 2008, TOCL.

[5]  Jean-Yves Girard,et al.  A new constructive logic: classic logic , 1991, Mathematical Structures in Computer Science.

[6]  Michael Mendler,et al.  Propositional Lax Logic , 1997, Inf. Comput..

[7]  Frank Pfenning,et al.  A judgmental reconstruction of modal logic , 2001, Mathematical Structures in Computer Science.

[8]  Luís Pinto,et al.  Cut-Elimination and a Permutation-Free Sequent Calculus for Intuitionistic Logic , 1998, Stud Logica.

[9]  Helmut Schwichtenberg,et al.  Basic proof theory , 1996, Cambridge tracts in theoretical computer science.

[10]  J. D. Johnson,et al.  5. Migration—The Inverse Method , 1982 .

[11]  Frank Pfenning,et al.  Focusing the Inverse Method for Linear Logic , 2005, CSL.

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

[13]  Alex K. Simpson,et al.  The proof theory and semantics of intuitionistic modal logic , 1994 .

[14]  Andrei Voronkov,et al.  The Inverse Method , 2001, Handbook of Automated Reasoning.

[15]  Jacob M. Howe A Permutation-free Calculus for Lax Logic , 2007 .

[16]  Helmut Schwichtenberg,et al.  Basic proof theory, Second Edition , 2000 .

[17]  D. Prawitz Natural Deduction: A Proof-Theoretical Study , 1965 .

[18]  Natasha Alechina,et al.  Categorical and Kripke Semantics for Constructive S4 Modal Logic , 2001, CSL.

[19]  Jacob M. Howe,et al.  Proof search issues in some non-classical logics , 1998 .

[20]  Thomas W. Satre,et al.  Natural deduction rules for modal logics , 1972, Notre Dame J. Formal Log..

[21]  Jacob M. Howe Proof search in Lax Logic , 2001, Math. Struct. Comput. Sci..

[22]  Christoph Kreitz,et al.  The ILTP Problem Library for Intuitionistic Logic , 2007, Journal of Automated Reasoning.

[23]  Valeria de Paiva,et al.  On an Intuitionistic Modal Logic , 2000, Stud Logica.