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

This article follows a tutorial, given by the authors on dynamic constraint solving at CP 2003
(Ninth International Conference on Principles and Practice of Constraint Programming) in …

Traditionally, constraint satisfaction problems (CSP) have assumed closed-world scenarios
where all domains and constraints are fixed from the beginning. With the Internet, many of …

We consider soft constraint problems where some of the preferences may be unspecified.
This models, for example, settings where agents are distributed and have privacy issues, or …

Planning and monitoring a trip is a common but complicated human activity. Creating an
itinerary is nontrivial because it requires coordination with existing schedules and making a …

While the information resources on the Web are vast, the sources are often hard to find,
painful to use, and difficult to integrate. We have developed the Heracles framework for …

Preference Elicitation with Interdependency and User Bother Cost Page 1 Preference
Elicitation with Interdependency and User Bother Cost Tiep Le New Mexico State University …

Publisher Summary This chapter provides an overview of the main techniques that have
been developed for constraint satisfaction and optimization in distributed settings. It …

Publisher Summary This chapter examines that constraint programming (CP) has proven to
be a very successful technique for reasoning about assignment problems. It discusses that …

Traditionally, constraint satisfaction has been applied in closed-world scenarios, where all
choices and constraints are known from the beginning and fixed. With the Internet, many of …