Oz

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 102 articles )

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

1 2 3 4 5 6 next

  1. Riguzzi, Fabrizio: The distribution semantics for normal programs with function symbols (2016)
  2. Iser, Markus; Manthey, Norbert; Sinz, Carsten: Recognition of nested gates in CNF formulas (2015)
  3. Hanus, Michael: Functional logic programming: from theory to curry (2013)
  4. Olarte, Carlos; Rueda, Camilo; Valencia, Frank D.: Models and emerging trends of concurrent constraint programming (2013)
  5. Schrijvers, Tom; Tack, Guido; Wuille, Pieter; Samulowitz, Horst; Stuckey, Peter J.: Search combinators (2013)
  6. Gorlin, Andrey; Ramakrishnan, C.R.; Smolka, Scott A.: Model checking with probabilistic tabled logic programming (2012)
  7. Lopes, Ricardo; Costa, Vítor Santos; Silva, Fernando: A design and implementation of the extended Andorra model (2012)
  8. Hosobe, Hiroshi; Satoh, Ken; Ma, Jiefei; Russo, Alessandra; Broda, Krysia: Speculative constraint processing for hierarchical agents (2010)
  9. Plagge, Daniel; Leuschel, Michael: Seven at one stroke: LTL model checking for high-level specifications in B, Z, CSP, and more (2010) ioport
  10. Schlich, Bastian; Kowalewski, Stefan: Model checking C source code for embedded systems (2009) ioport
  11. Buscemi, Maria Grazia; Montanari, Ugo: A survey of constraint-based programming paradigms (2008)
  12. Leuschel, Michael; Butler, Michael: Prob: An automated analysis toolset for the B method (2008) ioport
  13. Mancini, Toni; Micaletto, Davide; Patrizi, Fabio; Cadoli, Marco: Evaluating ASP and commercial solvers on the CSPLib (2008)
  14. 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)
  15. Backofen, Rolf; Will, Sebastian: A constraint-based approach to fast and exact structure prediction in three-dimensional protein models (2006)
  16. Linden, I.; Jacquet, J.-M.; De Bosschere, K.; Brogi, A.: On the expressiveness of timed coordination models (2006)
  17. 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)
  18. Meissner, Adam; Niwińska, Magdalena A.; Zwierzyński, Krzysztof T.: Computing an irregularity strength of selected graphs (2006)
  19. Nandivada, V.Krishna; Jagannathan, Suresh: Dynamic state restoration using versioning exceptions (2006)
  20. Niehren, J.; Schwinghammer, J.; Smolka, G.: A concurrent lambda calculus with futures (2006)

1 2 3 4 5 6 next


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