A Constraint Seeker: Finding and Ranking Global Constraints from Examples

Nicolas Beldiceanu (1) , Helmut Simonis (2)

1 TASC - Theory, Algorithms and Systems for Constraints
2 4C UCC - Cork Constraint Computation Centre

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.

Domaines: Mathématique discrète [cs.DM]

Nicolas Beldiceanu, Helmut Simonis. A Constraint Seeker: Finding and Ranking Global Constraints from Examples. 17th International Conference on Principles and Practice of Constraint Programming (CP'11), Sep 2011, Perrugia, Italy. pp.12-26, ⟨10.1007/978-3-642-23786-7_4⟩. ⟨hal-00754010⟩