The Mozart Programming System is an advanced development platform for intelligent, distributed applications. The system is the result of a decade of research in programming language design and implementation, constraint-based inference, distributed computing, and human-computer interfaces. As a result, Mozart is unequalled in expressive power and functionality. Mozart has an interactive incremental development environment and a production-quality implementation for Unix and Windows platforms. Mozart is the fruit of an ongoing research collaboration by the Mozart Consortium. Mozart is based on the Oz language, which supports declarative programming, object-oriented programming, constraint programming, and concurrency as part of a coherent whole. For distribution, Mozart provides a true network transparent implementation with support for network awareness, openness, and fault tolerance. Mozart supports multi-core programming with its network transparent distribution and is an ideal platform for both general-purpose distributed applications as well as for hard problems requiring sophisticated optimization and inferencing abilities. We have developed many applications including sophisticated collaborative tools, multi-agent systems, and digital assistants, as well as applications in natural language understanding and knowledge representation, in scheduling and time-tabling, and in placement and configuration.

References in zbMATH (referenced in 17 articles )

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

  1. Schulte, Christian; Tack, Guido: View-based propagator derivation (2013)
  2. Bergenti, F.; Chiarabini, L.; Rossi, G.: Programming with partially specified aggregates in Java (2011)
  3. Eames, Brandon K.; Neema, Sandeep K.; Saraswat, Rohit: DesertFD: a finite-domain constraint based tool for design space exploration (2010)
  4. Sadler, Andrew; Gervet, Carmen: Enhancing set constraint solvers with lexicographic bounds (2008)
  5. Apt, Krzysztof R.; Zoeteweij, Peter: An analysis of arithmetic constraints on integer intervals (2007)
  6. Sakellariou, Ilias; Vlahavas, Ioannis; Futo, Ivan; Pasztor, Zoltan; Szeredi, Janos: Communicating sequential processes for distributed constraint satisfaction (2006)
  7. Amandi, Analía; Campo, Marcelo; Zunino, Alejandro: JavaLog: a framework-based integration of Java and Prolog for agent-oriented programming (2005)
  8. Zunino, Alejandro; Campo, Marcelo; Mateos, Cristian: Are intelligent e-commerce agents partners or predators? (2005)
  9. Henz, Martin; Müller, Tobias; Thiel, Sven: Global constraints for round robin tournament scheduling. (2004)
  10. Zimmer, Jürgen; Melis, Erica: Constraint solving for proof planning (2004)
  11. Duchier, Denys: Dominance constraints with Boolean connectives: A model-eliminative treatment (2003)
  12. Van Roy, Peter; Brand, Per; Duchier, Denys; Haridi, Seif; Schulte, Christian; Henz, Martin: Logic programming in the context of multiparadigm programming: The Oz experience (2003)
  13. Davison, Andrew: Logic programming languages for the internet (2002)
  14. Zimmer, Jürgen; Kohlhase, Michael: System description: The MathWeb software bus for distributed mathematical reasoning (2002)
  15. Mello, Paola; Milano, Michela; Gavanelli, Marco; Lamma, Evelina; Piccardi, Massimo; Cucchiara, Rita: From eager or lazy constrained data acquisition: A general framework (2001)
  16. Wahls, Tim; Leavens, Gary T.; Baker, Albert L.: Executing formal specifications with concurrent constraint programming (2000)
  17. Henz, Martin; Müller, Tobias; Boon, Ng Ka: Figaro: Yet another constraint programming library (1999)

Further publications can be found at: