Abstract
Oz is an attempt to create a high-level concurrent programming language providing the problem solving capabilities of logic programming (i.e., constraints and search). Its computation model can be seen as a rather radical extension of the concurrent constraint model providing for higher-order programming, deep guards, state, and encapsulated search. This paper focuses on the most recent extension, a higher-order combinator providing for encapsulated search. The search combinator spawns a local computation space and resolves remaining choices by returning the alternatives as first-class citizens. The search combinator allows to program different search strategies, including depth-first, indeterministic one solution, demand-driven multiple solution, all solutions, and best solution (branch and bound) search. The paper also discusses the semantics of integer and finite domain constraints in a deep guard computation model.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M. Henz, M. Mehl, M. Müller, T. Müller, J. Niehren, R. Scheidhauer, C. Schulte, G. Smolka, R. Treinen, and J. Würtz. The Oz Handbook. Research Report RR-94-09, DFKI, 1994. Available through anonymous ftp from duck.dfki.uni-sb.de.
M. Henz, G. Smolka, and J. Würtz. Oz—a programming language for multi-agent systems. In 13th International Joint Conference on Artificial Intelligence, volume 1, pages 404–409, Chambéry, France, 1993. Morgan Kaufmann Publishers. Revised version will appear as
M. Henz, G. Smolka, and J. Würtz. Object-oriented concurrent constraint programming in Oz. In P. van Hentenryck and V. Saraswat, editors, Principles and Practice of Constraint Programming. The MIT Press, 1994. To appear.
S. Janson and S. Haridi. Programming paradigms of the Andorra kernel language. In Logic Programming, Proceedings of the 1991 International Symposium, pages 167–186. The MIT Press, 1991.
R. Milner. Functions as processes. Journal of Mathematical Structures in Computer Science, 2(2):119–141, 1992.
V. A. Saraswat and M. Rinard. Concurrent constraint programming. In Proceedings of the 7th Annual ACM Symposium on Principles of Programming Languages, pages 232–245, Jan. 1990.
C. Schulte and G. Smolka. Encapsulated search in higher-order concurrent constraint programming. In Logic Programming: Proceedings of the 1994 International Symposium, Ithaca, New York, USA, Nov. 1994. MIT-Press. To appear.
G. Smolka. A calculus for higher-order concurrent constraint programming with deep guards. Research Report RR-94-03, DFKI, Feb. 1994.
G. Smolka. A foundation for higher-order concurrent constraint programming. Research Report RR-94-16, DFKI, June 1994. Also in 1st International Conference on Constraints in Computational Logics, München, Germany, 7–9 September 1994.
P. Van Hentenryck, V. Saraswat, and Y. Deville. Design, implementation and evaluation of the constraint language cc(FD). Report CS-93-02, Brown University, Jan. 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schulte, C., Smolka, G., Würtz, J. (1994). Encapsulated search and constraint programming in Oz . In: Borning, A. (eds) Principles and Practice of Constraint Programming. PPCP 1994. Lecture Notes in Computer Science, vol 874. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58601-6_96
Download citation
DOI: https://doi.org/10.1007/3-540-58601-6_96
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58601-2
Online ISBN: 978-3-540-49032-6
eBook Packages: Springer Book Archive