The Inductive Constraint Programming Loop
(2017) IEEE Intelligent Systems — Vol. 32, n° 5, p. 44-52 (2017)
Files
ex5pap.pdf
Restricted Access - Adobe PDF
- 1.08 MB
Details
- Authors
- Abstract
- Constraint programming is used for a variety of real-world optimization problems, such as planning, scheduling, and resource allocation problems, all while we continuously gather vast amounts of data about these problems. Current constraint programming software doesn’t exploit such data to update schedules, resources, and plans. The authors propose a new framework that they call the inductive constraint programming loop. In this approach, data is gathered and analyzed systematically to dynamically revise and adapt constraints and optimization criteria. Inductive constraint programming aims to bridge the gap between the areas of data mining and machine learning on one hand and constraint programming on the other.
- Affiliations
Citations
Bessiere, C., De Raedt, L., Guns, T., Kotthoff, L., Nanni, M., Nijssen, S., O’Sullivan, B., Paparrizou, A., Pedreschi, D., & Simonis, H. (2017). The Inductive Constraint Programming Loop. IEEE Intelligent Systems, 32(5), 44-52. https://doi.org/10.1109/MIS.2017.3711637 (Original work published 2017)