Propositional Satisfiability (SAT) and Constraint Programming (CP) have developed as two
relatively independent threads of research cross-fertilizing occasionally. These two …

Constraint programming is a powerful paradigm for solving combinatorial search problems
that draws on a wide range of techniques from artificial intelligence, computer science …

Abstract Constraint Logic Programming (CLP) is a merger of two declarative paradigms:
constraint solving and logic programming. Although a relatively new field, CLP has …

Publisher Summary This chapter discusses that constraint reasoning involves various types
of techniques to tackle the inherent intractability of the problem of satisfying a set of …

Constraint programming (CP) is an emergent software technology for declarative description
and effective solving of large, particularly combinatorial, problems especially in areas of …

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 …

The field of data mining has become accustomed to specifying constraints on patterns of
interest. A large number of systems and techniques has been developed for solving such …

The design and implementation of constraint logic programming (CLP) languages over
intervals is revisited. Instead of decomposing complex constraints in terms of simple …

This paper presents a constraint logic programming model for the traveling salesman
problem with time windows which yields an exact branch-and-bound optimization algorithm …

Since the early days of logic programming, researchers in the field realized the potential for
exploitation of parallelism present in the execution of logic programs. Their high-level …