Solver Learning for Predicting Changes in Dynamic Constraint Satisfaction Problems
2004
We present a way of integrating machine learning capabilities in constraint reasoning systems by the use of partially defined constraints called Open Constraints. This enables a form of constraint reasoning with incomplete information: we use a machine learning algorithm to guess the missing part of the constraint and we put immediately this knowledge into the operational form of a solver. This approaches extends the field of applicability of constraint reasoning to problems which are difficult to model using classical constraints, and also potentially improves the efficiency of dynamic constraint solving. We illustrate our framework on online constraint solving applications which range from mobile computing to robotics.
Keywords:
- Constraint programming
- Constraint satisfaction dual problem
- Mathematical optimization
- Constraint (mathematics)
- Hybrid algorithm (constraint satisfaction)
- Constraint satisfaction
- Constraint logic programming
- Constraint learning
- Machine learning
- Concurrent constraint logic programming
- Artificial intelligence
- Mathematics
- Local consistency
- Theoretical computer science
- Constraint graph
- Binary constraint
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
39
References
8
Citations
NaN
KQI