Constraints

, Volume 21, Issue 4, pp 463–494

Extending SMT solvers with support for finite domain alldifferent constraint

Article

DOI: 10.1007/s10601-015-9232-8

Cite this article as:
Banković, M. Constraints (2016) 21: 463. doi:10.1007/s10601-015-9232-8

Abstract

In this paper we consider integration of SMT solvers with the filtering algorithms for the finite domain alldifferent constraint. Such integration makes SMT solvers suitable for solving constraint satisfaction problems with the alldifferent constraint involved. First, we present a novel algorithm for explaining inconsistencies and propagations in the alldifferent constraint. We compare it to Katsirelos’ algorithm and flow-based algorithms that are commonly used for that purpose. Then we describe our DPLL(T)-compliant SMT theory solver for constraint satisfaction problems that include alldifferent constraints. We also provide an experimental evaluation of our approach.

Keywords

SMT solving CSP solving alldifferent constraint Explanation algorithms 

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  1. 1.Faculty of MathematicsUniversity of BelgradeBelgradeSerbia