Solve a Constraint Problem without Modeling It - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

Solve a Constraint Problem without Modeling It

Remi Coletta
  • Fonction : Auteur
  • PersonId : 932759
Nadjib Lazaar

Résumé

We study how to find a solution to a constraint problem without modeling it. Constraint acquisition systems such as Conacq or ModelSeeker are not able to solve a single instance of a problem because they require positive examples to learn. The recent QuAcq algorithm for constraint acquisition does not require positive examples to learn a constraint network. It is thus able to solve a constraint problem without modeling it: we simply exit from QuAcq as soon as a complete example is classified as positive by the user. In this paper, we propose ASK&SOLVE, an elicitation-based solver that tries to find the best tradeoff between learning and solving to converge as soon as possible on a solution. We propose several strategies to speed-up ASK&SOLVE. Finally we give an experimental evaluation that shows that our approach improves the state of the art.
Fichier principal
Vignette du fichier
ictai14.pdf (296.54 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

lirmm-01228368 , version 1 (13-11-2015)

Identifiants

Citer

Christian Bessiere, Remi Coletta, Nadjib Lazaar. Solve a Constraint Problem without Modeling It. ICTAI: International Conference on Tools with Artificial Intelligence, Nov 2014, Limasso, Cyprus. pp.1-7, ⟨10.1109/ICTAI.2014.12⟩. ⟨lirmm-01228368⟩
161 Consultations
759 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More