The Community for Technology Leaders
Green Image
Issue No. 05 - September/October (2017 vol. 32)
ISSN: 1541-1672
pp: 44-52
Christian Bessiere , University of Montpellier
Luc De Raedt , KU Leuven
Tias Guns , KU Leuven
Lars Kotthoff , University of Wyoming
Mirco Nanni , ISTI-CNR
Siegfried Nijssen , KU Leuven
Barry OSullivan , University College Cork
Dino Pedreschi , University of Pisa
Helmut Simonis , University College Cork
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.
Artificial intelligence, Programming, Loss measurement, Data mining, Machine learning, Intelligent systems, Constraint optimization

C. Bessiere et al., "The Inductive Constraint Programming Loop," in IEEE Intelligent Systems, vol. 32, no. 5, pp. 44-52, 2017.
209 ms
(Ver 3.3 (11022016))