The Inductive Constraint Programming Loop
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.
KeywordsMachine Learning Constraint Satisfaction Learning Problem Constraint Programming Constraint Network
- [CJSS12]Coquery, E., Jabbour, S., Saïs, L., Salhi, Y.: A SAT-based approach for discovering frequent, closed and maximal patterns in a sequence. In: Proceedings of the 20th European Conference on Artificial Intelligence (ECAI 2012), Montpellier, France, pp. 258–263. IOS Press (2012)Google Scholar
- [DD88]Dechter, R., Dechter, A.: Belief maintenance in dynamic constraint networks. In: Proceedings of the 7th National Conference on Artificial Intelligence (AAAI 1888), St. Paul, MN, pp. 37–42. AAAI Press/The MIT Press (1988)Google Scholar
- [DGN08]De Raedt, L., Guns, T., Nijssen, S.: Constraint programming for itemset mining. In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), Las Vegas, Nevada, pp. 204–212. ACM (2008)Google Scholar
- [Wal02]Walsh, T.: Stochastic constraint programming. In: Proceedings of the 15th Eureopean Conference on Artificial Intelligence (ECAI 2002), Lyon, France, pp. 111–115. IOS Press (2002)Google Scholar