Oz is a high-level programming language combining constraint inference with concurrency. Typical application areas of Oz include optimization problems like scheduling, time tabling, placement and configuration, reasoning and knowledge representation, processing of natural language, simulations, multi agent systems, and sophisticated graphical user interfaces. Oz is dynamically typed and has first-class procedures, classes, objects, exceptions and sequential threads synchronizing over a constraint store. It supports finite domain and feature constraints and has powerful primitives for programming constraint inference engines at a high level.

References in zbMATH (referenced in 110 articles )

Showing results 1 to 20 of 110.
Sorted by year (citations)

1 2 3 4 5 6 next

  1. Olarte, Carlos; Rueda, Camilo; Valencia, Frank D.: Models and emerging trends of concurrent constraint programming (2013)
  2. Schrijvers, Tom; Tack, Guido; Wuille, Pieter; Samulowitz, Horst; Stuckey, Peter J.: Search combinators (2013)
  3. Lopes, Ricardo; Costa, Vítor Santos; Silva, Fernando: A design and implementation of the extended Andorra model (2012)
  4. Hosobe, Hiroshi; Satoh, Ken; Ma, Jiefei; Russo, Alessandra; Broda, Krysia: Speculative constraint processing for hierarchical agents (2010)
  5. Plagge, Daniel; Leuschel, Michael: Seven at one stroke: LTL model checking for high-level specifications in B, Z, CSP, and more (2010)
  6. Schlich, Bastian; Kowalewski, Stefan: Model checking C source code for embedded systems (2009)
  7. Buscemi, Maria Grazia; Montanari, Ugo: A survey of constraint-based programming paradigms (2008)
  8. Leuschel, Michael; Butler, Michael: Prob: An automated analysis toolset for the B method (2008)
  9. Mancini, Toni; Micaletto, Davide; Patrizi, Fabio; Cadoli, Marco: Evaluating ASP and commercial solvers on the CSPLib (2008)
  10. Braßel, Bernd: A framework for interpreting traces of functional logic computations. (2007)
  11. Linden, Isabelle; Jacquet, Jean-Marie: On the expressiveness of timed coordination via shared dataspaces. (2007)
  12. López Fraguas, Francisco J.; Rodríguez Artalejo, Mario; del Vado Vírseda, Rafael: A new generic scheme for functional logic programming with constraints (2007)
  13. Niehren, Joachim; Sabel, David; Schmidt-Schauß, Manfred; Schwinghammer, Jan: Observational semantics for a concurrent lambda calculus with reference cells and futures. (2007)
  14. Backofen, Rolf; Will, Sebastian: A constraint-based approach to fast and exact structure prediction in three-dimensional protein models (2006)
  15. Linden, I.; Jacquet, J.-M.; De Bosschere, K.; Brogi, A.: On the expressiveness of timed coordination models (2006)
  16. López, Hugo A.; Palamidessi, Catuscia; Pérez, Jorge A.; Rueda, Camilo; Valencia, Frank D.: A declarative framework for security: Secure concurrent constraint programming (2006)
  17. Meissner, Adam; Niwińska, Magdalena A.; Zwierzyński, Krzysztof T.: Computing an irregularity strength of selected graphs (2006)
  18. Nandivada, V.Krishna; Jagannathan, Suresh: Dynamic state restoration using versioning exceptions (2006)
  19. Niehren, J.; Schwinghammer, J.; Smolka, G.: A concurrent lambda calculus with futures (2006)
  20. Raja, N.; Shyamasundar, R.K.: A closer look at constraints as processes (2006)

1 2 3 4 5 6 next

Further publications can be found at: http://www.mozart-oz.org/papers/