The Inductive Constraint Programming Loop: Extended Abstract
(2016) Constraint programming and Data Mining - Foundations of a Cross-Disciplinary Approach — ISBN: [978-3-319-50137-6], p. 303-309, published
Files
12.pdf
Open Access - Adobe PDF
- 570.26 KB
Details
- Authors
- Abstract
- Constraint programming is used for a variety of real-world optimization problems, such as planning, scheduling and resource allocation problems. At the same time, one continuously gathers vast amounts of data about these problems. Current constraint programming software does not exploit such data to update schedules, resources and plans. We propose a new framework, that we call the Inductive Constraint Programming (ICON) loop. In this approach data is gathered and analyzed systematically in order to dynamically revise and adapt constraints and optimization criteria. Inductive Constraint Programming aims at bridging the gap between the areas of data mining and machine learning on the one hand, and constraint programming on the other hand.
- Affiliations
Citations
Bessiere, C., De Raedt, L., Guns, T., Kotthoff, L., Nanni, M., Nijssen, S., O’Sullivan, B., Paparrizou, A., Pedreschi, D., & Simonis, H. (2016). The Inductive Constraint Programming Loop: Extended Abstract. In Christian Bessiere, Luc De Raedt, Lars Kotthoff, Siegfried Nijssen, Barry O’Sullivan, Dino Pedreschi (ed.), Constraint programming and Data Mining - Foundations of a Cross-Disciplinary Approach (p. p. 303-309). Springer. https://doi.org/10.1007/978-3-319-50137-6_12