A Resolution-Based Theorem Prover for $${\textsf {K}}_{n}^{}$$Kn: Architecture, Refinements, Strategies and Experiments

AbstractIn this paper we describe the implementation of , a resolution-based prover for the basic multimodal logic $${\textsf {K}}_{n}^{}$$Kn. The prover implements a resolution-based calculus for both local and global reasoning. The user can choose different normal forms, refinements of the basic resolution calculus, and strategies. We describe these options in detail and discuss their implications. We provide experiments comparing some of these options and comparing the prover with other provers for this logic.

[1]  Vaughan R. Pratt,et al.  Application of modal logic to programming , 1980 .

[2]  Viktor Schuppan,et al.  Evaluating LTL Satisfiability Solvers , 2011, ATVA.

[3]  Peter F. Patel-Schneider,et al.  A New General Method to Generate Random Modal Formulae for Testing Decision Procedures , 2003, J. Artif. Intell. Res..

[4]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[5]  Larry Wos,et al.  Efficiency and Completeness of the Set of Support Strategy in Theorem Proving , 1965, JACM.

[6]  William McCune,et al.  OTTER 3.0 Reference Manual and Guide , 1994 .

[7]  Christoph Weidenbach,et al.  Computing Small Clause Normal Forms , 2001, Handbook of Automated Reasoning.

[8]  Clare Dixon,et al.  Clausal resolution for normal modal logics , 2007, J. Algorithms.

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

[10]  Brent Hailpern.  Verifying Concurrent Processes Using Temporal Logic , 1982, Lecture Notes in Computer Science.

[11]  Ulrike Sattler,et al.  BDD-based decision procedures for the modal logic K ★ , 2006, J. Appl. Non Class. Logics.

[12]  Joseph Y. Halpern.  USING REASONING ABOUT KNOWLEDGE TO ANALYZE DISTRIBUTED SYSTEMS , 1987 .

[13]  Ian Horrocks,et al.  Computational modal logic , 2007, Handbook of Modal Logic.

[14]  Rajeev Goré,et al.  Implementing Tableau Calculi Using BDDs: BDDTab System Description , 2014, IJCAR.

[15]  Anand S. Rao,et al.  Modeling Rational Agents within a BDI-Architecture , 1997, KR.

[16]  Gert Smolka,et al.  Spartacus: A Tableau Prover for Hybrid Logic , 2010, Electron. Notes Theor. Comput. Sci..

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

[18]  Maarten de Rijke,et al.  Tree-based Heuristics in Modal Theorem Proving , 2000, ECAI.

[19]  Francesco M. Donini,et al.  Design and Results of TANCS-2000 Non-classical (Modal) Systems Comparison , 2000, TABLEAUX.

[20]  Robert A. Kowalski,et al.  Semantic Trees in Automatic Theorem-Proving , 1983 .

[21]  Zohar Manna,et al.  A Hardware Semantics Based on Temporal Intervals , 1983, ICALP.

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

[23]  Clare Dixon,et al.  : A Resolution-Based Prover for Multimodal K , 2016, IJCAR.

[24]  Andrei Voronkov,et al.  First-Order Theorem Proving and Vampire , 2013, CAV.

[25]  Roberto Sebastiani,et al.  Automated Reasoning in Modal and Description Logics via SAT Encoding: the Case Study of K(m)/ALC-Satisfiability , 2009, J. Artif. Intell. Res..

[26]  Melvin Fitting,et al.  Prefixed tableaus and nested sequents , 2012, Ann. Pure Appl. Log..

[27]  J. A. Robinson,et al.  Automatic Deduction with Hyper-Resolution , 1983 .

[28]  Charisma Lee.  A completeness theorem and a computer program for finding theorems derivable from given axioms , 1967 .

[29]  Mark Kaminski,et al.  InKreSAT: Modal Reasoning via Incremental Reduction to SAT , 2013, CADE.

[30]  Arild Waaler,et al.  Connections in Nonclassical Logics , 2001, Handbook of Automated Reasoning.

[31]  Clare Dixon,et al.  Anti-prenexing and Prenexing for Modal Logics , 2006, JELIA.

[32]  Luca Viganò,et al.  Labelled Propositional Modal Logics: Theory and Practice , 1997, J. Log. Comput..

[33]  Peter Balsiger,et al.  A Benchmark Method for the Propositional Modal Logics K, KT, S4 , 2004, Journal of Automated Reasoning.

[34]  Carlos Areces,et al.  HyLoRes 1.0: Direct Resolution for Hybrid Logics , 2002, CADE.

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

[36]  David A. Plaisted,et al.  A Structure-Preserving Clause Form Translation , 1986, J. Symb. Comput..

[37]  Clare Dixon,et al.  A Modal-Layered Resolution Calculus for K , 2015, TABLEAUX.

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

[39]  Clare Dixon,et al.  Clausal temporal resolution , 1999, TOCL.

[40]  Thierry Boy de la Tour.  An Optimality Result for Clause Form Translation , 1992, J. Symb. Comput..

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

[42]  Valentin Goranko,et al.  Using the Universal Modality: Gains and Questions , 1992, J. Log. Comput..

[43]  Stéphane Demri,et al.  Prefixed Tableaux Systems for Modal Logics with Enriched Languages , 1997, IJCAI.

[44]  Stephan Schulz,et al.  Simple and Efficient Clause Subsumption with Feature Vector Indexing , 2013, Automated Reasoning and Mathematics.