Time-Bounded Query Generator for Constraint Acquisition - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2018

Time-Bounded Query Generator for Constraint Acquisition

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.
Fichier principal
Vignette du fichier
cpaior18.pdf (449.89 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

lirmm-01897928 , version 1 (18-10-2018)

Identifiers

Cite

Hajar Ait Addi, Christian Bessiere, 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⟩
112 View
323 Download

Altmetric

Share

Gmail Facebook X LinkedIn More