Encoding Linear Constraints into SAT

05/05/2020
by   Ignasi Abío, et al.
0

Linear integer constraints are one of the most important constraints in combinatorial problems since they are commonly found in many practical applications. Typically, encodings to Boolean satisfiability (SAT) format of conjunctive normal form perform poorly in problems with these constraints in comparison with SAT modulo theories (SMT), lazy clause generation (LCG) or mixed integer programming (MIP) solvers. In this paper we explore and categorize SAT encodings for linear integer constraints. We define new SAT encodings based on multi-valued decision diagrams, and sorting networks. We compare different SAT encodings of linear constraints and demonstrate where one may be preferable to another. We also compare SAT encodings against other solving methods and show they can be better than linear integer (MIP) solvers and sometimes better than LCG or SMT solvers on appropriate problems. Combining the new encoding with lazy decomposition, which during runtime only encodes constraints that are important to the solving process that occurs, gives the best option for many highly combinatorial problems involving linear constraints.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/24/2013

Proteus: A Hierarchical Portfolio of Solvers and Transformations

In recent years, portfolio approaches to solving SAT problems and CSPs h...
research
11/18/2022

Local Search For Satisfiability Modulo Integer Arithmetic Theories

Satisfiability Modulo Theories (SMT) refers to the problem of deciding t...
research
07/18/2023

Learning to Select SAT Encodings for Pseudo-Boolean and Linear Integer Constraints

Many constraint satisfaction and optimisation problems can be solved eff...
research
02/04/2017

Manyopt: An Extensible Tool for Mixed, Non-Linear Optimization Through SMT Solving

Optimization of Mixed-Integer Non-Linear Programming (MINLP) supports im...
research
12/07/2018

CSS Minification via Constraint Solving (Technical Report)

Minification is a widely-accepted technique which aims at reducing the s...
research
12/04/2012

An Empirical Evaluation of Portfolios Approaches for solving CSPs

Recent research in areas such as SAT solving and Integer Linear Programm...
research
02/18/2014

Hybrid SRL with Optimization Modulo Theories

Generally speaking, the goal of constructive learning could be seen as, ...

Please sign up or login with your details

Forgot password? Click here to reset