@inproceedings{6782b5fb80d84e6a949eca0b90fdd415,
title = "Acquiring constraint networks using a SAT-based version space algorithm",
abstract = "Constraint programming is a commonly used technology for solving complex combinatorial problems. However, users of this technology need significant expertise in order to model their problems appropriately. We propose a basis for addressing this problem: a new SAT-based version space algorithm for acquiring constraint networks from examples of solutions and non-solutions of a target problem. An important advantage of the algorithm is the ease with which domain-specific knowledge can be exploited.",
author = "Christian Bessiere and Remi Coletta and Fr{\'e}d{\'e}ric Koriche and Barry O'Sullivan",
year = "2006",
language = "English",
isbn = "1577352815",
series = "Proceedings of the National Conference on Artificial Intelligence",
pages = "1565--1568",
booktitle = "Proceedings of the 21st National Conference on Artificial Intelligence and the 18th Innovative Applications of Artificial Intelligence Conference, AAAI-06/IAAI-06",
note = "21st National Conference on Artificial Intelligence and the 18th Innovative Applications of Artificial Intelligence Conference, AAAI-06/IAAI-06 ; Conference date: 16-07-2006 Through 20-07-2006",
}