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 problems 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 SAT-based version space algorithm for acquiring constraint satisfaction problems from examples of solutions and non-solutions of a target problem. An important advantage is the ease with which domain-specific knowledge can be exploited using the new algorithm. Finally, we empirically demonstrate the algorithm and the effect of exploiting domain-specific knowledge on improving the quality of the acquired constraint network.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Bessiere, C., Coletta, R., Freuder, E.C., O’Sullivan, B.: Leveraging the learning power of examples in automated constraint acquisition. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 123–137. Springer, Heidelberg (2004)
Coletta, R., Bessiere, C., O’Sullivan, B., Freuder, E.C., O’Connell, S., Quinqueton, J.: Constraint acquisition as semi-automatic modeling. In: Proc. of AI 2003, pp. 111–124 (2003)
Dowling, W.F., Gallier, J.H.: Linear-time algorithms for testing the satisfiability of propositional horn formulae. Journal of Logic Programming 1(3), 267–284 (1984)
Freuder, E.C., Wallace, R.J.: Suggestion strategies for constraint-based matchmaker agents. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 192–204. Springer, Heidelberg (1998)
Haussler, D.: Quantifying inductive bias: AI learning algorithms and Valiant’s learning framework. Artificial Intelligence 36(2), 177–221 (1988)
Hirsh, H.: Polynomial-time learning with version spaces. In: Proceedings of AAAI 1992, pp. 117–122 (1992)
Hirsh, H., Mishra, N., Pitt, L.: Version spaces without boundary sets. In: Proceedings AAAI 1997, pp. 491–496 (1997)
Hirsh, H., Mishra, N., Pitt, L.: Version spaces and the consistency problem. Artificial Intelligence 156(2), 115–138 (2004)
Kleine Büning, H., Lettmann, T.: Propositional Logic: Deduction and Algorithms. Cambridge University Press, Cambridge (1999)
Lallouet, A., Legtchenko, A., Monfroy, E., Ed-Dbali, A.: Solver learning for predicting changes in dynamic constraint satisfaction problems. In: Changes 2004 (2004)
Mitchell, T.: Generalization as search. Artificial Intelligence 18(2), 203–226 (1982)
Monasson, R., Zecchina, R., Kirkpatrick, S., Selman, B., Ttroyansky, L.: Determining computational complexity from characteristic ’phase transition’. Nature 400, 133–137 (1999)
O’Sullivan, B., Freuder, E.C., O’Connell, S.: Interactive constraint acquisition – position paper. In: Workshop on User-Interaction in Constraint Satisfaction, pp. 73–81 (2001)
Padmanabhuni, S., You, J.-H., Ghose, A.: A framework for learning constraints. In: Proceedings of the PRICAI Workshop on Induction of Complex Representations (August 1996)
Rossi, F., Sperduti, A.: Acquiring both constraint and solution preferences in interactive constraint systems. Constraints 9(4), 311–332 (2004)
Wallace, M.: Practical applications of constraint programming. Constraints 1(1–2), 139–168 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bessiere, C., Coletta, R., Koriche, F., O’Sullivan, B. (2005). A SAT-Based Version Space Algorithm for Acquiring Constraint Satisfaction Problems. In: Gama, J., Camacho, R., Brazdil, P.B., Jorge, A.M., Torgo, L. (eds) Machine Learning: ECML 2005. ECML 2005. Lecture Notes in Computer Science(), vol 3720. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11564096_8
Download citation
DOI: https://doi.org/10.1007/11564096_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29243-2
Online ISBN: 978-3-540-31692-3
eBook Packages: Computer ScienceComputer Science (R0)