Combining Local Search and Constraint Propagation to Find a Minimal Change Solution for a Dynamic CSP Export

@inproceedings{citeulike:612638, abstract = {Many hard practical problems such as Time Tabling and Scheduling can be formulated as Constraint Satisfaction Problems. For these CSPs, powerful problem-solving methods are available. However, in practice, the problem definition may change over time. Each separate change may invoke a new CSP formulation. The resulting sequence of CSPs is denoted as a Dynamic CSP.}, author = {Roos, Nico and Ran, Yongping and van den Herik, Jaap H.}, booktitle = {Artificial Intelligence: Methodology, Systems, Applications}, citeulike-article-id = {612638}, citeulike-linkout-0 = {http://citeseer.ist.psu.edu/roos00combining.html}, citeulike-linkout-1 = {http://citeseer.lcs.mit.edu/roos00combining.html}, citeulike-linkout-2 = {http://citeseer.ifi.unizh.ch/roos00combining.html}, citeulike-linkout-3 = {http://citeseer.comp.nus.edu.sg/roos00combining.html}, keywords = {abandoned, constraint, csc5240, searching}, pages = {272--282}, posted-at = {2006-05-03 19:39:08}, priority = {3}, title = {Combining Local Search and Constraint Propagation to Find a Minimal Change Solution for a Dynamic CSP}, url = {http://citeseer.ist.psu.edu/roos00combining.html}, year = {2000} }

TY - CONF ID - citeulike:612638 L3 - citeulike-article-id:612638 N2 - Many hard practical problems such as Time Tabling and Scheduling can be formulated as Constraint Satisfaction Problems. For these CSPs, powerful problem-solving methods are available. However, in practice, the problem definition may change over time. Each separate change may invoke a new CSP formulation. The resulting sequence of CSPs is denoted as a Dynamic CSP. EP - 282 TI - Combining Local Search and Constraint Propagation to Find a Minimal Change Solution for a Dynamic CSP T2 - Artificial Intelligence: Methodology, Systems, Applications SP - 272 KW - abandoned KW - constraint KW - csc5240 KW - searching AU - Roos, Nico AU - Ran, Yongping AU - van den Herik, Jaap PY - 2000/// UR - http://citeseer.ist.psu.edu/roos00combining.html ER -