Minimal Perturbation Problem - A Formal View
|Autoři||BARTÁK Roman — MÜLLER Tomáš — RUDOVÁ Hana|
|Druh||Článek ve sborníku|
|Citace||BARTÁK, Roman, Tomáš MÜLLER a Hana RUDOVÁ. Minimal Perturbation Problem - A Formal View. In Proceedings of ERCIM Working Group on Constraints/CompulogNet Area on "Constraint Programming" Workshop. Budapest (Hungary): MTA SZTAKI, 2003. s. 209-226.|
|Klíčová slova||constraint satisfaction; solution update; timetabling|
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. However, the traditional formulation of the constraint satisfaction problem is static in the sense that it must be fully specified before the solving process starts. 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. We also discuss a first proposal of the algorithm for solving such type of problems.
- Související projekty: