High-level nondeterministic abstractions in c++

Authors:
Laurent Michel;Andrew See;Pascal Van Hentenryck
Affiliations:
University of Connecticut, Storrs, CT;University of Connecticut, Storrs, CT;Brown University, Providence, RI
Venue:
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Year:
2006

Citing 6
Cited 2

Opening the Prolog III universe

BYTE
Constraint satisfaction in logic programming

Constraint satisfaction in logic programming
The OPL optimization programming language

The OPL optimization programming language
SALSA: A Language for Search Algorithms

CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
Search Procedures and Parallelism in Constraint Programming

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Nondeterministic control for hybrid search

CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Transparent Parallelization of Constraint Programming

INFORMS Journal on Computing
Monadic constraint programming

Journal of Functional Programming

Quantified Score

Hi-index	0.00

Visualization

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.