MleanCoP: A Connection Prover for First-Order Modal Logic

MleanCoP is a fully automated theorem prover for first-order modal logic. The proof search is based on a prefixed connection calculus and an additional prefix unification, which captures the Kripke semantics of different modal logics. MleanCoP is implemented in Prolog and the source code of the core proof search procedure consists only of a few lines. It supports the standard modal logics D, T, S4, and S5 with constant, cumulative, and varying domain conditions. The most recent version also supports heterogeneous multimodal logics and outputs a compact prefixed connection proof. An experimental evaluation shows the strong performance of MleanCoP.

[1]  Jens Otten,et al.  The QMLTP Problem Library for First-Order Modal Logics , 2012, IJCAR.

[2]  Nikolaj Bjørner,et al.  Automated Deduction - CADE-23 - 23rd International Conference on Automated Deduction, Wroclaw, Poland, July 31 - August 5, 2011. Proceedings , 2011, CADE.

[3]  Christoph Benzmüller,et al.  HOL Based First-Order Modal Logic Provers , 2013, LPAR.

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

[5]  Jens Otten,et al.  leanCoP 2.0and ileanCoP 1.2: High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (System Descriptions) , 2008, IJCAR.

[6]  Frank Wolter,et al.  Handbook of Modal Logic , 2007, Studies in logic and practical reasoning.

[7]  Claudio Pizzi,et al.  Modalities and Multimodalities - With the assistance and collaboration of Juliana Bueno-Soler , 2008, Logic, Epistemology, and the Unity of Science.

[8]  Jens Otten.  Restricting backtracking in connection calculi , 2010, AI Commun..

[9]  Chad E. Brown.  Reducing Higher-Order Theorem Proving to a Sequence of SAT Problems , 2013, Journal of Automated Reasoning.

[10]  Richard L. Mendelsohn,et al.  First-Order Modal Logic , 1998 .

[11]  Christoph Benzmüller,et al.  Implementing and Evaluating Provers for First-order Modal Logics , 2012, ECAI.

[12]  Jens Otten,et al.  A Non-clausal Connection Calculus , 2011, TABLEAUX.

[13]  Lincoln A. Wallen,et al.  Automated deduction in nonclassical logics , 1990 .

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

[15]  Frank Wolter,et al.  Monodic fragments of first-order temporal logics: 2000-2001 A.D , 2001, LPAR.

[16]  Jens Otten.  Implementing Connection Calculi for First-order Modal Logics , 2012, IWIL@LPAR.

[17]  Wolfgang Bibel,et al.  Automated Theorem Proving , 1987, Artificial Intelligence / Künstliche Intelligenz.

[18]  Bernhard Beckert,et al.  Free Variable Tableaux for Propositional Modal Logics , 1997, TABLEAUX.

[19]  Ullrich Hustadt,et al.  MSPASS: Modal Reasoning by Translation and First-Order Resolution , 2000, TABLEAUX.