The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem
defined by a network of local cost functions defined over discrete variables. It has …

Recently, a general definition of arc consistency (AC) for soft constraint frameworks has
been proposed by T. Schiex [Proc. CP-2000, Singapore, 2000, pp. 411–424]. In this paper …

The notion of arc consistency plays a central role in constraint satisfaction [R. Dechter,
Constraint Processing, Morgan Kaufmann, San Mateo, CA, 2003]. It is known since the …

Traditionally, local consistency is defined as a relaxation of consistency which can be
checked in polynomial time. It is accompanied by a corresponding “filtering” or “enforcing” …

In recent years, many constraint-specific filtering algorithms have been introduced. Such
algorithms use the semantics of the constraint to perform filtering more efficiently than a …

The Valued (VCSP) framework is a generic optimization framework with a wide range of
applications. Soft arc consistency operations transform a VCSP into an equivalent problem …

We summarize existing approaches to model and solve overconstrained problems. These
problems are usually formulated as combinatorial optimization problems, and different …

We introduce an exact algorithm for maximizing the number of satisfied constraints in an
overconstrained CSP (Max-CSP). The algorithm, which can also solve weighted CSP …

Agent technology is evolving as a leading field of research connected to diverse areas such
as AI, E-commerce, robotics and information retrieval. Agents systems use reasoning and …

Page 1 Martin Cooper | | | | | | | | | | | | | | | || | || | || || | || || | || | || | Line Drawing Interpretation
Springer Page 2 Line Drawing Interpretation Page 3 Martin Cooper Line Drawing …