We provide an overall description of the Ciao multiparadigm programming system
emphasizing some of the novel aspects and motivations behind its design and …

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

Constraint Handling Rules (CHR) are our proposal to allow more flexibility and application-
oriented customization of constraint systems. CHR are a declarative language extension …

A constraint can be thought of intuitively as a restriction on a space of possibilities.
Mathematical constraints are precisely specifiable relations among several unknowns (or …

Constraint Handling Rules (CHR) is both a theoretical formalism based on logic and a
practical programming language based on rules. This book, written by the creator of CHR …

This paper describes the design, implementation, and applications of the constraint logic
language cc (FD). cc (FD) is a declarative nondeterministic constraint logic language over …

Abstract Constraint Handling Rules (CHR) allow one to specify and implement both
propagation and simplification for user-defined constraints. Since a propagation rule is …

Timetabling the courses offered at the Computer Science Department of the University of
Munich requires the processing of hard and soft constraints. Hard constraints are conditions …

In this paper we illustrate the facilities for type debugging of Haskell programs in the
Chameleon programming environment. Chameleon provides an extension to Haskell …

An extension of constraint logic programming that allows for weighted partial satisfaction of
soft constraints is described and applied to the development of an automated timetabling …