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

A large number of problems in AI and other areas of computer science can be viewed as
special cases of the constraint-satisfaction problem. Some examples are machine vision …

In this paper, we study the problem of interpreting line drawings of scenes composed of
opaque regular solid objects bounded by piecewise smooth surfaces with no markings or …

Constraint satisfaction problems (CSPs) involve finding values for variables subject to
constraints on which combinations of values are permitted. This paper develops a concept of …

We present in this paper a unified processing for real, integer, and Boolean constraints
based on a general narrowing algorithm which applies to any n-ary relation on R. The basic …

Selecting and arranging parts is the core of a configuration task. The validity of a
configuration is defined in terms of constraints. Highly declarative, domain independent and …

One of the main difficulties with configuration problem solving lies in the representation of
the domain knowledge because many different aspects, such as taxonomy, topology …

We propose a logical framework for depiction and interpretation that formalizes image
domain knowledge, scene domain knowledge and the depiction mapping between the …

Publisher Summary This chapter focuses on the emergence of constraint satisfaction, with
constraint languages, as a new paradigm within artificial intelligence and computer science …

This paper describes our experience with a simple modeling and programming approach for
increasing the amount of constraint propagation in the constraint solving process. The idea …