Abstract
Inductive Constraint Solving is a subfield of inductive machine learning concerned with the automatic generation of rule-based constraint solvers. In this paper, we propose an approach to generate constraint solvers given the definition of the constraints that combines the advantages of generation by construction with generation by testing. In our proposed approach, semantically valid rules are constructed symbolically, then the constructed rules are used to prune the search tree of a generate and test method. The combined approach leads in general to more expressive and efficient constraint solvers. The generated rules are implemented in the language Constraint Handling Rules.
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., Frühwirth, T.: Integration and Optimization of Rule-based Constraint Solvers. In: International Symposium on Logic-based Program Synthesis and Transformation, LOPSTR 2003. LNCS, Springer, Heidelberg (2004)
Abdennadher, S., Rigotti, C.: Automatic Generation of Propagation Rules for Finite Domains. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, Springer, Heidelberg (2000)
Abdennadher, S., Rigotti, C.: Towards Inductive Constraint Solving. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 31–45. Springer, Heidelberg (2001)
Abdennadher, S., Rigotti, C.: Automatic Generation of CHR Constraint Solvers. Journal of Theory and Practice of Logic Programming (TPLP)Â 5(2) (2005)
Apt, K., Monfroy, E.: Automatic Generation of Constraint Propagation Algorithms for Small Finite Domains. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 58–72. Springer, Heidelberg (1999)
Codognet, P.: A Tabulation Method for Constraint Logic Programs. In: 8th Symposuim and Exibition on Industrial Applications of Prolog (1995)
Warren, D.S., Cui, B.: A System for Tabled Constraint Logic Programming. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol. 1861, Springer, Heidelberg (2000)
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)
Monfroy, E., Ringeissen, C.: Generating Propagation Rules for Finite Domains: A Mixed Approach. In: Apt, K.R., Kakas, A.C., Monfroy, E., Rossi, F. (eds.) Compulog Net WS 1999. LNCS (LNAI), vol. 1865, Springer, Heidelberg (2000)
Sobhi, I.: Constructive generation of rule-based constraint solvers. Master’s thesis, German University in Cairo (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abdennadher, S., Sobhi, I. (2008). Generation of Rule-Based Constraint Solvers: Combined Approach. In: King, A. (eds) Logic-Based Program Synthesis and Transformation. LOPSTR 2007. Lecture Notes in Computer Science, vol 4915. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78769-3_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-78769-3_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78768-6
Online ISBN: 978-3-540-78769-3
eBook Packages: Computer ScienceComputer Science (R0)