DMCA
A SAT-based version space algorithm for acquiring constraint satisfaction problems (2005)
| Venue: | In Proceedings of ECML’05 |
| Citations: | 21 - 8 self |
BibTeX
@INPROCEEDINGS{Bessiere05asat-based,
author = {Christian Bessiere and Remi Coletta and Frédéric Koriche},
title = {A SAT-based version space algorithm for acquiring constraint satisfaction problems},
booktitle = {In Proceedings of ECML’05},
year = {2005},
pages = {23--34},
publisher = {Springer}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. Constraint programming is rapidly becoming the technology of choice for modelling and solving complex combinatorial problems. However, users of this technology need significant expertise in order to model their problem appropriately. The lack of availability of such expertise is a significant bottleneck to the broader uptake of constraint technology in the real world. We present a new SATbased version space algorithm for acquiring constraint satisfaction problems from examples of solutions and non-solutions of the target problem. We show how domain-specific knowledge related to constraint redundancy can be exploited in a number of ways using the new algorithm. We highlight a number of advantages of our approach. Finally, we empirically demonstrate the algorithm and the effect of exploiting domain-specific knowledge. 1
