Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

Studying Interchangeability in Constraint Satisfaction Problems

Nicoleta NeaguContact Information

(5)  Artificial Intelligence Laboratory (LIA) Computer Science Department, Swiss Federal Institute of Technology (EPFL), CH-1015 Ecublens, Switzerland
Abstract
Most work in constraint satisfaction has concentrated on computing a solution to a given problem. In practice, it often happens that an existing solution needs to be modified to satisfy additional criteria or changes in the problem. For example, a schedule or plan might have to be adjusted when a resource is missing. The concept of interchangeability characterizes the possibilities for making local changes to CSP solutions.

Keywords  constraint satisfaction problem - interchangeability - soft constraint satisfaction problems


Contact Information Nicoleta Neagu
Email: neagu@lia.di.epfl.ch
URL: http://liawww.epfl.ch/
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this chapter
Export this chapter as RIS | Text
 
Remote Address: 38.107.191.107 • Server: mpweb03
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)