Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers

There is a relatively large number of papers dealing with complexity and proof theory issues of multiple-valued logics. Nevertheless, little attention has been paid so far to the development of efficient and robust solvers for such logics. In this paper we investigate how the technology of Satisfiability Modulo Theories (SMT) can be effectively used to build efficient automated theorem provers for relevant finitely-valued and infinitely-valued logics, taking the logics of Łukasiewicz, Godel and Product as case studies. Besides, we report on an experimental investigation that evaluates the performance of SMT technology when solving multiple-valued logic problems, and compares the finitely-valued solvers for Łukasiewicz and Godel logics with their infinitely-valued solvers from a computational point of view. We also compare the performance of SMT technology and MIP technology when testing the satisfiability on a genuine family of multiple-valued clausal forms.

[1]  Carlos Ansótegui,et al.  Building Automated Theorem Provers for Infinitely-Valued Logics with Satisfiability Modulo Theory Solvers , 2012, 2012 IEEE 42nd International Symposium on Multiple-Valued Logic.

[2]  Roberto Sebastiani,et al.  Lazy Satisability Modulo Theories , 2007, J. Satisf. Boolean Model. Comput..

[3]  Peter Jipsen.  Basic Logic, SMT solvers and finitely generated varieties of GBL-algebras , 2013, TACL.

[4]  Petr Hájek,et al.  Metamathematics of Fuzzy Logic , 1998, Trends in Logic.

[5]  Reiner Hähnle,et al.  Many-valued logic and mixed integer programming , 1994, Annals of Mathematics and Artificial Intelligence.

[6]  Toby Walsh,et al.  Handbook of Constraint Programming (Foundations of Artificial Intelligence) , 2006 .

[7]  Steven Schockaert,et al.  Satisfiability Checking in Łukasiewicz Logic as Finite Constraint Satisfaction , 2011, Journal of Automated Reasoning.

[8]  Reiner Hähnle,et al.  Automated deduction in multiple-valued logics , 1993, International series of monographs on computer science.

[9]  Christian G. Fermüller,et al.  Resolution-Based Theorem Proving for Manyvalued Logics , 1995, J. Symb. Comput..

[10]  Siegfried Gottwald,et al.  Mathematical Fuzzy Logics , 2008, Bulletin of Symbolic Logic.

[11]  P. Mostert,et al.  On the Structure of Semigroups on a Compact Manifold With Boundary , 1957 .

[12]  Brunella Gerla,et al.  Complexity issues in basic logic , 2005, Soft Comput..

[13]  Reiner Hähnle,et al.  The SAT problem of signed CNF formulas , 2000 .

[14]  Hector J. Levesque,et al.  Hard and Easy Distributions of SAT Problems , 1992, AAAI.

[15]  Ramón Béjar,et al.  Phase Transitions in the Regular Random 3-SAT Problem , 1999, ISMIS.

[16]  Nicola Olivetti.  Tableaux for Łukasiewicz Infinite-valued Logic , 2003, Stud Logica.

[17]  L. D. Moura,et al.  The YICES SMT Solver , 2006 .

[18]  Christer Bäckström,et al.  A Linear-Programming Approach to Temporal Reasoning , 1996, AAAI/IAAI, Vol. 2.

[19]  Reiner Hähnle,et al.  Short Conjunctive Normal Forms in Finitely Valued Logics , 1994, J. Log. Comput..

[20]  Lluis Godo,et al.  An SMT-Based Solver for Continuous t-norm Based Logics , 2012, SUM.

[21]  Felip Manyà,et al.  Finding Hard Instances of Satisfiability in Lukasiewicz Logics , 2015, 2015 IEEE International Symposium on Multiple-Valued Logic.

[22]  S. Gottwald.  A Treatise on Many-Valued Logics , 2001 .

[23]  Nikolaj Bjørner,et al.  Z3: An Efficient SMT Solver , 2008, TACAS.

[24]  Christian G. Fermüller,et al.  Uniform Rules and Dialogue Games for Fuzzy Logics , 2005, LPAR.

[25]  Martine De Cock,et al.  Solving satisfiability in fuzzy logics by mixing CMA-ES , 2013, GECCO '13.