Skip to Main content Skip to Navigation
Conference papers

Solve a Constraint Problem without Modeling It

Christian Bessière 1 Remi Coletta 1 Nadjib Lazaar 1
1 COCONUT - Agents, Apprentissage, Contraintes
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download
Contributor : Joël Quinqueton <>
Submitted on : Friday, November 13, 2015 - 8:50:28 AM
Last modification on : Monday, January 11, 2021 - 5:24:17 PM
Long-term archiving on: : Friday, April 28, 2017 - 7:35:01 AM


Files produced by the author(s)




Christian Bessière, 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⟩



Record views


Files downloads