Other formats:
BibTeX
LaTeX
RIS
@inproceedings{555152, author = {Barták, Roman and Müller, Tomáš and Rudová, Hana}, address = {Budapest (Hungary)}, booktitle = {Proceedings of ERCIM Working Group on Constraints/CompulogNet Area on "Constraint Programming" Workshop}, keywords = {constraint satisfaction; solution update; timetabling}, language = {eng}, location = {Budapest (Hungary)}, pages = {209-226}, publisher = {MTA SZTAKI}, title = {Minimal Perturbation Problem - A Formal View}, url = {http://www.fi.muni.cz/~hanka/publications.html}, year = {2003} }
TY - JOUR ID - 555152 AU - Barták, Roman - Müller, Tomáš - Rudová, Hana PY - 2003 TI - Minimal Perturbation Problem - A Formal View PB - MTA SZTAKI CY - Budapest (Hungary) KW - constraint satisfaction KW - solution update KW - timetabling UR - http://www.fi.muni.cz/~hanka/publications.html N2 - 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. ER -
BARTÁK, Roman, Tomáš MÜLLER and Hana RUDOVÁ. Minimal Perturbation Problem - A Formal View. In \textit{Proceedings of ERCIM Working Group on Constraints/CompulogNet Area on ''Constraint Programming'' Workshop}. Budapest (Hungary): MTA SZTAKI, 2003, p.~209-226.
|