Extending Multiple-Valued Clausal Forms with Linear Integer Arithmetic

We extend the language of signed many-valued clausal forms with linear integer arithmetic constraints. In this way, we get a simple modeling language in which a wide range of practical combinatorial problems admit compact and natural encodings. We then define efficient translations from our language into the SAT and SMT formalism, and propose to use SAT and SMT solvers for finding solutions.

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

[2]  Meinolf Sellmann,et al.  A Complete Multi-valued SAT Solver , 2010, CP.

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

[4]  Mutsunori Banbara,et al.  Compiling Finite Linear CSP into SAT , 2006, CP.

[5]  Reiner Hähnle,et al.  Uniform Notation of Tableau Rules for Multiple-Valued Logics , 1991, ISMVL.

[6]  Cesare Tinelli,et al.  Handbook of Satisfiability , 2021, Handbook of Satisfiability.

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

[8]  Steven David Prestwich,et al.  CNF Encodings , 2021, Handbook of Satisfiability.