InKreSAT: Modal Reasoning via Incremental Reduction to SAT

InKreSAT is a prover for the modal logics K, T, K4, and S4. InKreSAT reduces a given modal satisfiability problem to a Boolean satisfiability problem, which is then solved using a SAT solver. InKreSAT improves on previous work by proceeding incrementally. It interleaves translation steps with calls to the SAT solver and uses the feedback provided by the SAT solver to guide the translation. This results in better performance and allows to integrate blocking mechanisms known from modal tableau provers. Blocking, in turn, further improves performance and makes the approach applicable to the logics K4 and S4.

[1]  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.

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

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

[4]  Fausto Giunchiglia,et al.  SAT-Based Decision Procedures for Classical Modal Logics , 2004, Journal of Automated Reasoning.

[5]  Chad E. Brown.  Reducing Higher-Order Theorem Proving to a Sequence of SAT Problems , 2011, CADE.

[6]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[7]  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..

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

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

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

[11]  Armando Tacchella,et al.  *SAT System Description , 1999, Description Logics.

[12]  Fabio Massacci.  Design and Results of the Tableaux-99 Non-classical (Modal) Systems Comparison , 1999, TABLEAUX.

[13]  Harald Ganzinger,et al.  New directions in instantiation-based theorem proving , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

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

[15]  Melvin Fitting,et al.  Modal proof theory , 2007, Handbook of Modal Logic.

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

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

[18]  Franz Baader,et al.  Cardinality Restrictions on Concepts , 1994, KI.

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

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

[21]  Armando Tacchella,et al.  A Subset-Matching Size-Bounded Cache for Testing Satisfiability in Modal Logics , 2004, Annals of Mathematics and Artificial Intelligence.