Semi-automatic modeling by constraint acquisition

  • Remi Coletta
  • , Christian Bessière
  • , Barry O'Sullivan
  • , Eugene C. Freuder
  • , Sarah O'Connell
  • , Joel Quinqueton

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

Abstract

Constraint programming is a technology which is now widely used to solve combinatorial problems in industrial applications. However, using it requires considerable knowledge and expertise in the field of constraint reasoning. This paper introduces a framework for automatically learning constraint networks from sets of instances that are either acceptable solutions or non-desirable assignments of the problem we would like to express. Such an approach has the potential to be of assistance to a novice who is trying to articulate her constraints. By restricting the language of constraints used to build the network, this could also assist an expert to develop an efficient model of a given problem.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsFrancesca Rossi
PublisherSpringer Verlag
Pages812-816
Number of pages5
ISBN (Print)3540202021, 9783540202028
DOIs
Publication statusPublished - 2003

Publication series

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

Fingerprint

Dive into the research topics of 'Semi-automatic modeling by constraint acquisition'. Together they form a unique fingerprint.

Cite this