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

We describe the design and implementation of a finite domain constraint solver embedded
in a Prolog system using an extended unification mechanism via attributed variables as a …

Both logic programming in general and Prolog in particular have a long and fascinating
history, intermingled with that of many disciplines they inherited from or catalyzed. A large …

We present the clp (FD) system: a constraint logic programming language with finite domain
constraints. We detail its implementation, and present an abstract instruction set for the …

Publisher Summary This chapter reviews that constraint logic programming (CLP) is the
merger of two declarative paradigms: constraint solving and logic programming. As both …

This paper compares the efficiency of a number of Constraint Logic Programming (CLP)
systems in the setting of finite domains as well as a specific aspect of their expressiveness …

In this paper, we concentrate on a typical scheduling problem: the computation of a
timetable for a German college. Like many other scheduling problems, this problem contains …

This article presents a database of about 200 graph invariants for deriving systematically
necessary conditions from the graph properties based representation of global constraints …

We study in this paper the use of consistency techniques and local propagation methods,
originally developed for constraints over finite domains, for solving boolean constraints in …

We present an extension to indexicals to describe propagators for global constraints. The
resulting language is compiled into actual propagators for different solvers, and is solver …