Due to recent booming of unmanned air vehicles (UAVs) technologies, these are being used
in many fields involving complex tasks. Some of them involve a high risk to the vehicle …

We perform a comprehensive study of map**s between constraint satisfaction problems
(CSPs) and propositional satisfiability (SAT). We analyse four different map**s of SAT …

We extend the framework of simple temporal problems studied originally by Dechter, Meiri
and Pearl to consider constraints of the form x 1− y 1≤ r 1∨⋯∨ xn− yn≤ rn, where x 1 …

Constraint programming (CP) methods exhibit several parallels with branch-and-cut
methods for mixed integer programming (MIP). Both generate a branching tree. Both use …

Graph pattern matching is a central problem in many application fields. Since it is NP-
complete, we cannot expect to find algorithms with a good worst-case performance …

Over the past few years, a new constraint-based formalism for temporal reasoning has been
developed to represent and reason about Disjunctive Temporal Problems (DTPs). The class …

We propose some global constraints for lexicographic orderings on vectors of variables.
These constraints are very useful for breaking a certain kind of symmetry arising in matrices …

The purpose of this introductory chapteris to provide the basicconcepts behind Constraint
Programming (CP) and IntegerProgramming (IP). These two fields covera variety of aspects …

We introduce function variables to constraint programs (CP), variables whose values are
one of (exponentially many) possible functions between two sets. Such variables are useful …

When writing a constraint program, we have to decide what to make the decision variable,
and how to represent the constraints on these variables. In many cases, there is …