The Inductive Constraint Programming Loop

Abstract : Constraint programming is used for a variety of real-world optimisation 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 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.
Document type :
Journal articles
Complete list of metadatas

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01276193
Contributor : Joël Quinqueton <>
Submitted on : Monday, October 15, 2018 - 4:29:26 PM
Last modification on : Thursday, February 21, 2019 - 10:30:03 AM
Long-term archiving on : Wednesday, January 16, 2019 - 3:30:14 PM

File

ieee-is17.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Christian Bessière, Luc De Raedt, Tias Guns, Lars Kotthoff, Mirco Nanni, et al.. The Inductive Constraint Programming Loop. IEEE Intelligent Systems, Institute of Electrical and Electronics Engineers, 2017, 32 (5), pp.44-52. ⟨10.1109/MIS.2017.3711637⟩. ⟨lirmm-01276193⟩

Share

Metrics

Record views

150

Files downloads

26