A SAT-Based Version Space Algorithm for Acquiring Constraint Satisfaction Problems - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2005

A SAT-Based Version Space Algorithm for Acquiring Constraint Satisfaction Problems

Abstract

Constraint programming is rapidly becoming the technology of choice for modelling and solving complex combinatorial problems. However, users of this technology need significant expertise in order to model their problems appropriately. The lack of availability of such expertise is a significant bottleneck to the broader uptake of constraint technology in the real world. We present a new SAT-based version space algorithm for acquiring constraint satisfaction problems from examples of solutions and non-solutions of a target problem. An important advantage is the ease with which domain-specific knowledge can be exploited using the new algorithm. Finally, we empirically demonstrate the algorithm and the effect of exploiting domain-specific knowledge on improving the quality of the acquired constraint network.

Dates and versions

lirmm-00106044 , version 1 (13-10-2006)

Identifiers

Cite

Christian Bessiere, Remi Coletta, Frédéric Koriche, Barry O’Sullivan. A SAT-Based Version Space Algorithm for Acquiring Constraint Satisfaction Problems. ECML 2005 - 16th European Conference on Machine Learning, Oct 2005, Porto, Portugal. pp.23-34, ⟨10.1007/11564096_8⟩. ⟨lirmm-00106044⟩
83 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More