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

Research output: Chapter in Book/Report/Conference proceedingsChapterpeer-review

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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages303-309
Number of pages7
DOIs
Publication statusPublished - 1 Dec 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10101 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'The inductive constraint programming loop'. Together they form a unique fingerprint.

Cite this