Publication details

Minimal Perturbation Problem - A Formal View

Investor logo


Year of publication 2003
Type Article in Periodical
Magazine / Source Neural Network World/IDG
MU Faculty or unit

Faculty of Informatics

Field Informatics
Keywords constraint satisfaction; solution update; soft constraints; timetabling
Description Formulation of many real-life problems evolves as the problem is being solved. These changes are typically initiated by a user intervention or by changes in the environment. In this paper, we propose a formal description of so called minimal perturbation problem that allows an "automated" modification of the (partial) solution when the problem formulation changes. Our model is defined for constraint satisfaction problems with emphasis put on finding a solution anytime even for over-constrained problems.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.

More info