Constraint Acquisition (CA) aims to widen the use of constraint programming by assisting users in the modeling process. However, most CA methods suffer from a significant drawback: they learn a single set of individual constraints for a specific problem instance, but cannot generalize these constraints to the parameterized constraint specifications of the problem. In this paper, we address this limitation by proposing GenCon, a novel approach to learn parameterized constraint models capable of modeling varying instances of the same problem. To achieve this generalization, we make use of statistical learning techniques at the level of individual constraints. Specifically, we propose to train a classifier to predict, for any possible constraint and parameterization, whether the constraint belongs to the problem. We then show how, for some classes of classifiers, we can extract decision rules to construct interpretable constraint specifications. This enables the generation of ground constraints for any parameter instantiation. Additionally, we present a generate-and-test approach that can be used with any classifier, to generate the ground constraints on the fly. Our empirical results demonstrate that our approach achieves high accuracy and is robust to noise in the input instances.
Overcoming Over-Fitting in Constraint Acquisition via Query-Driven Interactive Refinement
Department of Electrical and Computer Engineering, University of Western Macedonia(电子与计算机工程系,西马其顿大学);Department of Computer Science, KU Leuven(计算机科学系,鲁汶大学)
CNRS(法国国家科学研究中心);University of Montpellier(蒙彼利埃大学);DTAI, KU Leuven(鲁汶大学DTAI研究所);LAAS-CNRS(法国国家科学研究中心自动化与系统分析实验室);INRA Toulouse(法国国家农业食品与环境研究院图卢兹中心);Samsung Research America(三星美国研究院);University Laval(拉瓦尔大学);University of Western Macedonia(西马其顿大学);NICTA, UNSW(澳大利亚国立信息技术、通信和数学科学研究局、新南威尔士大学)