Constraint Maintenance with Preferences and Underlying Flexible Solution
John L. Bresina, Ari Jónsson, Paul H. Morris, Kanna Rajan · 2003
On-line problem solving is a significant issue for many practical applications, where solutions must be executed as the operating environment changes. Many of the application areas have been tackled by constraint based methods, but current constraint solving tools offer little support for on-line problems. Possible enhancements could include rapid reaction to problem changes, prediction of future changes and contingent solutions, time guarantees or exploitation of known time limits. This workshop aims to bring together researchers interested in these topics, to consider how existing techniques can be enhanced, and to explore combinations of different techniques. The workshop will be of interest to those modelling and solving real world problems, to those interested in theoretical issues in constraint solving, and also to members of the Uncertainty in AI and Planning and Scheduling communities. The most recent antecedents of this workshop were the CP2001 workshops OLCP’01 (Online combinatorial problem solving and Constraint Programming) and CUW’01 (Constraints and Uncertainty). All submissions to the workshop were reviewed by at least two referees. Five papers were selected for full presentation, and are contained in these working notes. The workshop will