Sciweavers

AAAI
2006

Acquiring Constraint Networks Using a SAT-based Version Space Algorithm

13 years 5 months ago
Acquiring Constraint Networks Using a SAT-based Version Space Algorithm
Constraint programming is a commonly used technology for solving complex combinatorial problems. However, users of this technology need significant expertise in order to model their problems appropriately. We propose a basis for addressing this problem: a new SAT-based version space algorithm for acquiring constraint networks from examples of solutions and non-solutions of a target problem. An important advantage of the algorithm is the ease with which domain-specific knowledge can be exploited.
Christian Bessière, Remi Coletta, Fré
Added 30 Oct 2010
Updated 30 Oct 2010
Type Conference
Year 2006
Where AAAI
Authors Christian Bessière, Remi Coletta, Frédéric Koriche, Barry O'Sullivan
Comments (0)