SAT-Based Techniques for Integer Linear Constraints

13 pages•Published: December 18, 2015

Abstract

Conflict-Driven Clause-Learning (CDCL) SAT and SAT Modulo Theories (SMT) solvers are well known as workhorses for, e.g., formal verification applications. Here we discuss ways to go beyond by learning not only clauses, but also much more expressive constraints. We outline techniques for Integer Linear Programming (ILP), going first from SAT to SMT for ILP and then to SMT with on-the-fly bottleneck constraint encoding. Then we illustrate the power of learning full constraints, and the resulting methods for 0-1 ILP (Pseudo-Boolean solvers) and full ILP (Cutsat and IntSat), outlining difficulties and their solutions, giving examples and some intuition on why these techniques work so well.

Keyphrases: constraint satisfaction, linear integer arithmetic, sat solving

In: Georg Gottlob, Geoff Sutcliffe and Andrei Voronkov (editors). GCAI 2015. Global Conference on Artificial Intelligence, vol 36, pages 1-13.

Links:	https://easychair.org/publications/paper/hKJK
	https://doi.org/10.29007/4dtv

BibTeX entry

@inproceedings{GCAI2015:SAT_Based_Techniques_Integer,
  author    = {Robert Nieuwenhuis},
  title     = {SAT-Based Techniques for Integer Linear Constraints},
  booktitle = {GCAI 2015. Global Conference on Artificial Intelligence},
  editor    = {Georg Gottlob and Geoff Sutcliffe and Andrei Voronkov},
  series    = {EPiC Series in Computing},
  volume    = {36},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/hKJK},
  doi       = {10.29007/4dtv},
  pages     = {1-13},
  year      = {2015}}

Download PDF Open PDF in browser