Query-Driven Constraint Acquisition
Proceedings of the Twentieth International Joint Conference on Artificial Intelligence. Pages 50-54.
Abstract
The modelling and reformulation of constraint networks are recognised as important problems. The task of automatically acquiring a constraint network formulation of a problem from a subset of its solutions and non-solutions has been presented in the literature. However, the choice of such a subset was assumed to be made independently of the acquisition process. We present an approach in which an interactive acquisition system actively selects a good set of examples. We show that the number of examples required to acquire a constraint network is significantly reduced using our approach.
@inproceedings{ijcai2007p6,
title = {Query-Driven Constraint Acquisition},
author = {Bessiere, Christian and Coletta, Remi and O'Sullivan, Barry and Paulin, Mathias},
booktitle = {Proceedings of the Twentieth International Joint Conference on
Artificial Intelligence, {IJCAI-07}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Ramon López de Mántaras},
pages = {50--54},
year = {2007},
url = {https://ijcai.org/proceedings/2007/6},
}
TY - CPAPER TI - Query-Driven Constraint Acquisition AU - Bessiere, Christian AU - Coletta, Remi AU - O'Sullivan, Barry AU - Paulin, Mathias T2 - Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, IJCAI-07 PB - International Joint Conferences on Artificial Intelligence PY - 2007 SP - 50 EP - 54 UR - https://ijcai.org/proceedings/2007/6 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
