A Model Seeker: Extracting Global Constraint Models from Positive Examples

Nicolas Beldiceanu 1, * Helmut Simonis 2
* Corresponding author
1 TASC - Theory, Algorithms and Systems for Constraints
LINA - Laboratoire d'Informatique de Nantes Atlantique, Département informatique - EMN, Inria Rennes – Bretagne Atlantique
Abstract : We describe a system which generates finite domain constraint models from positive example solutions, for highly structured problems. The system is based on the global constraint catalog, providing the library of constraints that can be used in modeling, and the Constraint Seeker tool, which finds a ranked list of matching constraints given one or more sample call patterns. We have tested the modeler with 230 examples, ranging from 4 to 6,500 variables, using between 1 and 7,000 samples. These examples come from a variety of domains, including puzzles, sports-scheduling, packing & placement, and design theory. When comparing against manually specified "canonical" models for the examples, we achieve a hit rate of 50\%, processing the complete benchmark set in less than one hour on a laptop. Surprisingly, in many cases the system finds usable candidate lists even when working with a single, positive example.
Document type :
Conference papers
Complete list of metadatas

Contributor : Contraintes Lina <>
Submitted on : Tuesday, November 20, 2012 - 8:32:10 AM
Last modification on : Friday, June 22, 2018 - 9:31:53 AM



Nicolas Beldiceanu, Helmut Simonis. A Model Seeker: Extracting Global Constraint Models from Positive Examples. 18th International Conference on Principles and Practice of Constraint Programming (CP'12), Oct 2012, Quebec, Canada. pp.141-157, ⟨10.1007/978-3-642-33558-7_13⟩. ⟨hal-00754044⟩



Record views