Abstract
Developing constraint solvers which are key requisites of constraint programming languages is time consuming and difficult. In this paper, we propose a generic algorithm that symbolically constructs rule-based solvers from the intensional definition of the constraint. Unlike the well-established “generate and test” approach, our symbolic construction approach is capable of generating recursive rules from a recursive constraint definition. Combining the two approaches gives better filtering capabilities than either of the approaches acting alone.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abdennadher, S., Rigotti, C.: Automatic Generation of CHR Constraint Solvers. Journal of Theory and Practice of Logic Programming (TPLP) 5(4-5), 403–418 (2005)
Carlsson, M., Beldiceanu, N.: Revisiting the Lexicographic Ordering Constraint. Technical Report T2002-17, Swedish Institute of Computer Science (2002)
Frisch, A., Hnich, B., Kzltan, Z., Miguel, I., Walsh, T.: Global Constraints for Lexicographic Orderings. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 93–108. Springer, Heidelberg (2002)
Frühwirth, T.: Complete Propagation Rules for Lexicograhic Order Constraints over Arbitary Domains. In: Hnich, B., Carlsson, M., Fages, F., Rossi, F. (eds.) CSCLP 2005. LNCS, vol. 3978, pp. 14–28. Springer, Heidelberg (2006)
Abdennadher, S., Sobhi, I.: Generation of Rule-based Constraint Solvers: Combined Approach. In: King, A. (ed.) LOPSTR 2007. LNCS, vol. 4915, pp. 106–120. Springer, Heidelberg (2008)
Clark, K.: Negation as Failure. In: Logic and Databases, pp. 293–322. Plenum Press, New York (1978)
Frühwirth, T.: Theory and Practice of Constraint Handling Rules, Special Issue on Constraint Logic Programming. Journal of Logic Programming 37(1-3), 95–138 (1998)
Frühwirth, T.: Proving Termination of Constraint Solver Programs. In: Apt, K.R., Kakas, A.C., Monfroy, E., Rossi, F. (eds.) Compulog Net WS 1999. LNCS, vol. 1865, pp. 298–317. Springer, Heidelberg (2000)
Abdennadher, S., Frühwirth, T.: Integration and Optimization of Rule-based Constraint Solvers. In: Bruynooghe, M. (ed.) LOPSTR 2004. LNCS, vol. 3018, pp. 198–213. Springer, Heidelberg (2004)
Sneyers, J., Schrijvers, T., Demoen, B.: Guard and Continuation Optimization for Occurrence Representations of CHR. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol. 3668, pp. 83–97. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Sobhi, I., Abdennadher, S., Betz, H. (2008). Constructing Rule-Based Solvers for Intentionally-Defined Constraints. In: Schrijvers, T., Frühwirth, T. (eds) Constraint Handling Rules. Lecture Notes in Computer Science(), vol 5388. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92243-8_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-92243-8_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92242-1
Online ISBN: 978-3-540-92243-8
eBook Packages: Computer ScienceComputer Science (R0)