Solve a Constraint Problem without Modeling It - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2014

Solve a Constraint Problem without Modeling It

Remi Coletta
  • Function : Author
  • PersonId : 932759
Nadjib Lazaar

Abstract

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
Origin : Files produced by the author(s)
Loading...

Dates and versions

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

Identifiers

Cite

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⟩
156 View
754 Download

Altmetric

Share

Gmail Facebook X LinkedIn More