Abstract
This paper presents high-level abstractions for nondeterministic search in C++ which provide the counterpart to advanced features found in recent constraint languages. The abstractions have several benefits: they explicitly highlight the nondeterministic nature of the code, provide a natural iterative style, simplify debugging, and are efficiently implementable using macros and continuations. Their efficiency is demonstrated by comparing their performance with the C++ library Gecode, both for programming search procedures and search engines.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Colmerauer, A.: Opening the Prolog-III Universe. BYTE Magazine 12(9) (1987)
de Givry, S., Jeannin, L.: Tools: A library for partial and hybrid search methods. In: CP-AI-OR 2003 (2003)
Heintze, N.C., Michaylov, S., Stuckey, P.J.: CLP(\(\Re\)) and some Electrical Engineering Problems. In: ICLP 1987 (1987)
Generic Constraint Development Environment (2005) http://www.gecode.org/
Ilog Solver 4.4. Reference Manual. Ilog SA, Gentilly, France (1998)
Laburthe, F., Caseau, Y.: SALSA: A Language for Search Algorithms. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, p. 310. Springer, Heidelberg (1998)
Lauriere, J.-L.: A Language and a Program for Stating and Solving Combinatorial Problems. Artificial Intelligence 10(1), 29–127 (1978)
Michel, L., Van Hentenryck, P.: Modeler++: A Modeling Layer for Constraint Programming Libraries. In: CP-AI-OR 2001 (2001)
Perron, L.: Search Procedures and Parallelism in Constraint Programming. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 346–361. Springer, Heidelberg (1999)
Puget, J.-F.: A C++ Implementation of CLP. In: Proceedings of SPICIS 1994 (1994)
Puget, J.-F.: Personal Communication (March 2006)
Schulte, C.: Programming Constraint Inference Engines. In: CP 1997 (1997)
Van Hentenryck, P.: Constraint Satisfaction in Logic Programming. The MIT Press, Cambridge (1989)
Van Hentenryck, P.: The OPL Optimization Programming Language. The MIT Press, Cambridge (1999)
Van Hentenryck, P., Michel, L.: Nondeterministic Control for Hybrid Search. In: CP-AI-OR 2005 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Michel, L., See, A., Van Hentenryck, P. (2006). High-Level Nondeterministic Abstractions in C++ . In: Benhamou, F. (eds) Principles and Practice of Constraint Programming - CP 2006. CP 2006. Lecture Notes in Computer Science, vol 4204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11889205_27
Download citation
DOI: https://doi.org/10.1007/11889205_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46267-5
Online ISBN: 978-3-540-46268-2
eBook Packages: Computer ScienceComputer Science (R0)