TY - GEN
T1 - A model seeker
T2 - 18th International Conference on Principles and Practice of Constraint Programming, CP 2012
AU - Beldiceanu, Nicolas
AU - Simonis, Helmut
PY - 2012
Y1 - 2012
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/84868286347
U2 - 10.1007/978-3-642-33558-7_13
DO - 10.1007/978-3-642-33558-7_13
M3 - Conference proceeding
AN - SCOPUS:84868286347
SN - 9783642335570
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 141
EP - 157
BT - Principles and Practice of Constraint Programming - 18th International Conference, CP 2012, Proceedings
Y2 - 8 October 2012 through 12 October 2012
ER -