 |
HAL-LIRMM - Open Archive |  |
Conference papers
Acquiring Constraint Networks using a SAT-based Version Space Algorithm
Abstract : 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 address- ing 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 advan- tage of the algorithm is the ease with which domain-specific knowledge can be exploited.
Cited literature [3 references]
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00135484
Contributor : Christian Bessiere <>
Submitted on : Thursday, March 8, 2007 - 11:48:22 AM
Last modification on : Monday, January 11, 2021 - 5:24:09 PM
Long-term archiving on: : Tuesday, April 6, 2010 - 10:09:10 PM
Contributor : Christian Bessiere <>
Submitted on : Thursday, March 8, 2007 - 11:48:22 AM
Last modification on : Monday, January 11, 2021 - 5:24:09 PM
Long-term archiving on: : Tuesday, April 6, 2010 - 10:09:10 PM