Finite domain propagation solvers effectively represent the possible values of variables by a
set of choices which can be naturally modelled as Boolean variables. In this paper we …

In this paper, we propose a new method to encode Constraint Satisfaction Problems (CSP)
and Constraint Optimization Problems (COP) with integer linear constraints into Boolean …

Lazy clause generation is a powerful hybrid approach to combinatorial optimization that
combines features from SAT solving and finite domain (FD) propagation. In lazy clause …

Finite domain propagation solvers effectively represent the possible values of variables by a
set of choices which can be naturally modelled as Boolean variables. In this paper we …

Generating test cases for combinatorial testing is to find a covering array in Combinatorial
Designs. In this paper, we consider the problem of finding optimal covering arrays by SAT …

This paper gives some details on the implementation of sugar constraint solver submitted to
the Second International CSP Solver Competition. The sugar solver solves a finite linear …

This paper considers the problem of scheduling n jobs on m machines in an open shop
environment so that the sum of completion times or mean flow time becomes minimal. It …

While the efficiency and scalability of modern SAT technology offers an intriguing alternative
approach to constraint solving via translation to SAT, previous work has mostly focused on …

This paper presents an optimal constraint programming approach for the open-shop
scheduling problem, which integrates recent constraint propagation and branching …

We present a new approach to enhancing Answer Set Programming (ASP) with Constraint
Processing techniques which allows for solving interesting Constraint Satisfaction Problems …