A Bit-Vector Approach to Satisfiability Testing in Finitely-Valued Logics

We define a new bit-vector approach for reducing the satisfiability problem of any finitely-valued logic to SAT. Our approach consists of first encoding both the finitely-valued logic and the formula under consideration as an SMT program under the logic of quantifier-free uninterpreted functions and bit vectors (QF_UFBV), and then automatically derive a SAT instance using flattening techniques and efficient CNF conversion algorithms. Moreover, we report on an experimental investigation that shows that the proposed approach is competitive.

[1]  Felip Manyà,et al.  MaxSAT, Hard and Soft Constraints , 2021, Handbook of Satisfiability.

[2]  Daniel Kroening,et al.  Decision Procedures - An Algorithmic Point of View , 2008, Texts in Theoretical Computer Science. An EATCS Series.

[3]  Carlos Ansótegui,et al.  Mapping Problems with Finite-Domain Variables into Problems with Boolean Variables , 2004, SAT.

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

[5]  Panagiotis Manolios,et al.  BAT: The Bit-Level Analysis Tool , 2007, CAV.

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

[7]  Reiner Hähnle,et al.  Advanced Many-Valued Logics , 2001 .

[8]  Reiner Hähnle,et al.  A modular reduction of regular logic to classical logic , 2001, Proceedings 31st IEEE International Symposium on Multiple-Valued Logic.

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

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

[11]  Bruno Dutertre,et al.  Yices 2.2 , 2014, CAV.

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

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

[14]  Carlos Ansótegui,et al.  SAT and SMT Technology for Many-Valued Logics , 2015, J. Multiple Valued Log. Soft Comput..

[15]  Zhu Zhu,et al.  Optimizing with minimum satisfiability , 2012, Artif. Intell..

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

[17]  Carlos Ansótegui,et al.  Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers , 2016, Fuzzy Sets Syst..

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

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