Skip to Main content Skip to Navigation
Conference papers

Time-Bounded Query Generator for Constraint Acquisition

Hajar Addi 1 Christian Bessière 2 Redouane Ezzahir 1 Nadjib Lazaar 2
2 COCONUT - Agents, Apprentissage, Contraintes
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : QUACQ is a constraint acquisition algorithm that assists a non-expert user to model her problem as a constraint network. QUACQ generates queries as examples to be classified as positive or negative. One of the drawbacks of QUACQ is that generating queries can be time-consuming. In this paper we present TQ-GEN, a time-bounded query generator. TQ-GEN is able to generate a query in a bounded amount of time. We rewrite QUACQ to incorporate the TQ-GEN generator. This leads to a new algorithm called T-QUACQ. We propose several strategies to make T-QUACQ efficient. Our experimental analysis shows that thanks to the use of TQ-GEN, T-QUACQ dramatically improves the basic QUACQ in terms of time consumption, and sometimes also in terms of number of queries.
Document type :
Conference papers
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01897928
Contributor : Christian Bessiere <>
Submitted on : Thursday, October 18, 2018 - 11:02:22 AM
Last modification on : Friday, October 23, 2020 - 4:48:28 PM
Long-term archiving on: : Saturday, January 19, 2019 - 1:18:23 PM

File

cpaior18.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Hajar Addi, Christian Bessière, Redouane Ezzahir, Nadjib Lazaar. Time-Bounded Query Generator for Constraint Acquisition. CPAIOR: Integration of Constraint Programming, Artificial Intelligence, and Operations Research, Jun 2018, Delft, Netherlands. pp.1-17, ⟨10.1007/978-3-319-93031-2_1⟩. ⟨lirmm-01897928⟩

Share

Metrics

Record views

222

Files downloads

377