Skip to main navigation Skip to search Skip to main content

A constraint seeker: Finding and ranking global constraints from examples

  • Nicolas Beldiceanu
  • , Helmut Simonis
  • IMT Atlantique

Research output: Chapter in Book/Report/Conference proceedingsConference proceedingpeer-review

Abstract

In this paper we describe a Constraint Seeker application which provides a web interface to search for global constraints in the global constraint catalog, given positive and negative, fully instantiated (ground) examples. Based on the given instances the tool returns a ranked list of matching constraints, the rank indicating whether the constraint is likely to be the intended constraint of the user. We give some examples of use cases and generated output, describe the different elements of the search and ranking process, discuss the role of constraint programming in the different tools used, and provide evaluation results over the complete global constraint catalog. The Constraint Seeker is an example for the use of generic meta-data provided in the catalog to solve a specific problem.

Original languageEnglish
Title of host publicationPrinciples and Practice of Constraint Programming, CP 2011 - 17th International Conference, Proceedings
Pages12-26
Number of pages15
DOIs
Publication statusPublished - 2011
Event17th International Conference on Principles and Practice of Constraint Programming, CP 2011 - Perugia, Italy
Duration: 12 Sept 201116 Sept 2011

Publication series

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

Conference

Conference17th International Conference on Principles and Practice of Constraint Programming, CP 2011
Country/TerritoryItaly
CityPerugia
Period12/09/1116/09/11

Fingerprint

Dive into the research topics of 'A constraint seeker: Finding and ranking global constraints from examples'. Together they form a unique fingerprint.

Cite this