Acquiring Constraint Networks using a SAT-based Version Space Algorithm - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2006

Acquiring Constraint Networks using a SAT-based Version Space Algorithm

Frédéric Koriche
Remi Coletta
  • Function : Author
  • PersonId : 932759
Barry O'Sullivan
  • Function : Author
  • PersonId : 849989

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.
Fichier principal
Vignette du fichier
aaai06.pdf (93.5 Ko) Télécharger le fichier
Loading...

Dates and versions

lirmm-00135484 , version 1 (08-03-2007)

Identifiers

  • HAL Id : lirmm-00135484 , version 1

Cite

Christian Bessiere, Frédéric Koriche, Remi Coletta, Barry O'Sullivan. Acquiring Constraint Networks using a SAT-based Version Space Algorithm. AAAI Conference on Artificial Intelligence, Jul 2006, Boston, MA, United States. pp.1565-1568. ⟨lirmm-00135484⟩
240 View
152 Download

Share

Gmail Facebook X LinkedIn More