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

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 …

The use of constraints had its scientific and commercial breakthrough in the 1990s.
Programming with constraints makes it possible to model and specify problems with …

Abstract Constraint Handling Rules (CHRs) are a high-level rule-based programming
language commonly used to write constraint solvers. The theoretical operational semantics …

As today's most complex computing environment, the Internet confronts IT researchers,
system designers, and application developers with completely new challenges and, as a …

Sperber, Cara, and Girotto (Cognition52 (1995) 3) argued that, in Wason's selection task,
relevance-guided comprehension processes tend to determine participants' performance …

The generalization of the satisfiability problem with arbitrary quantifiers is a challenging
problem of both theoretical and practical relevance. Being PSPACE-complete, it provides a …

The paper describes the advantages of the use of constraint logic programming to articulate
transformation rules for multimedia presentation in combination with efficient constraint …

We study here a natural situation when constraint programming can be entirely reduced to
rule-based programming. To this end we explain first how one can compute on constraint …

A general n-ary constraint is usually represented explicitly as a set of its solution tuples,
which may need exponential space. In this paper, we introduce a new representation for …