The Inductive Constraint Programming Loop

Christian Bessiere, Luc De Raedt, Tias Guns, Lars Kotthoff, Mirco Nanni, Siegfried Nijssen, Barry O'Sullivan, Anastasia Paparrizou, Dino Pedreschi, Helmut Simonis

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.
BibTeX
@inproceedings{bessiere2017inductive,
  author = {Christian Bessiere and Luc De Raedt and Tias Guns and Lars Kotthoff and Mirco Nanni and Siegfried Nijssen and Barry O'Sullivan and Anastasia Paparrizou and Dino Pedreschi and Helmut Simonis},
  title = {{The Inductive Constraint Programming Loop}},
  booktitle = {IEEE Intell. Syst},
  year = {2017},
  url = {https://openreview.net/forum?id=__J74CfqUOM},
}
Figure