The Inductive Constraint Programming Loop

by   Christian Bessiere, et al.

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.


page 1

page 2

page 3

page 4


Users Constraints in Itemset Mining

Discovering significant itemsets is one of the fundamental problems in d...

Parallel Constraint-Driven Inductive Logic Programming

Multi-core machines are ubiquitous. However, most inductive logic progra...

Architecture and Knowledge Representation for Composable Inductive Programming

We present an update on the current architecture of the Zoea knowledge-b...

A Proof Theoretic View of Constraint Programming

We provide here a proof theoretic account of constraint programming that...

Frequent Itemset Mining with Multiple Minimum Supports: a Constraint-based Approach

The problem of discovering frequent itemsets including rare ones has rec...

New methods for new data? An overview and illustration of quantitative inductive methods for HRM research

"Data is the new oil", in short, data would be the essential source of t...

A global Constraint for mining Sequential Patterns with GAP constraint

Sequential pattern mining (SPM) under gap constraint is a challenging ta...

Please sign up or login with your details

Forgot password? Click here to reset