Extending Multiple-Valued Clausal Forms with Linear Integer Arithmetic

Abstract

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.