G. Smolka and R. Treinen (Eds.), DFKI Oz Documentation Series, DFKI, Saarbrucken, Germany, 1994.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... Institute for Artificial Intelligence (DFKI) Her93] and in 1994 as a library of ECL i PS e [FrBr95a, FrBr95b] CHR are currently also implemented in the successor language ECL i PS e 2 at IC Parc of Imperial College and in the concurrent logical object oriented constraint language OZ [SmTr94]. Overview of this Paper We quickly recapture syntax and semantics for CHR. Then we describe the three phases of the new compilation scheme and the runtime system for CHR that will be based on attributed variables. We conclude with a comparison with the previous implementation. An example will ....

G. Smolka and R. Treinen (Ed.), DFKI Oz Documentation Series, DFKI, Saarbrucken, Germany, 1994.

....supported by ESPRIT BRA project No. 8130: LOMAPS. y Dept. of Teleinformatics, Royal Institute of Technology, Electrum 204, S 164 40 Kista, Sweden. Work partially supported by The Human Capital and Mobility Project EXPRESS. 1 The relevance of the fl calculus lies in its relationship to Oz [Smo95b, Smo94, Smo95a] Oz is a real programming language; its performance is comparable to commercial implementations of Lisp or Prolog, it has an extensive programming environment, and it supports important concepts like higherorder functions, object oriented programming, and concurrent constraints. ....

G. Smolka. An Oz primer. DFKI Oz documentation series, DFKI, Saarbrucken, Germany, 1995. Available as ftp://ps-ftp.dfki.uni-sb.de/pub/oz/documentation /Primer.ps.Z.

.... for Artificial Intelligence (DFKI) Her93] and in 1994 as a library of ECL i PS e [FrBr95a, FrBr95b, FrBr96] It is currently implemented in Sicstus Prolog at LMU, Munich, in ECL i PS e 2 at IC Parc of Imperial College and in the concurrent logical object oriented constraint language OZ [SmTr94a]. Cheer [Fru91, Fru92, Fru93b] was a small but fully functional interpreter. By small we mean about 300 clauses, 900 lines, 25KB of code. By fully functional we mean that Cheer included a preprocessor for CHR, delaying conjunction, incremental constraints residuation, a tracing tool for CHR ....

G. Smolka and R. Treinen (Eds.), DFKI Oz Documentation Series, DFKI, Saarbrucken, Germany, 1994.

....used in the Browser can also be applied to tasks like building interactive graphical applications, multi agent and concurrent control systems. Keywords Oz, Application development, the Oz Browser, Concurrency, Object Oriented Programming, the Oz Execution Strategy. 1. Introduction Oz [Smo95b], Smo95c] HM94] is a powerful multiparadigm programming language which combines concurrent constraint programming [SRP91] with object oriented programming [ASS85] Indeterminism by concurrent objects is one of the main problems in concurrent object oriented programming (for instance, see the ....

....Intelligence (DFKI) EMail: popow fcs,dfkig.uni sb.de Using these mechanisms and, in particular, combining effects of them during developing any reasonably large Oz program can be a complicated task. Corresponding Programming techniques are not yet studied in papers dedicated to programming in Oz [Smo95b], HM94] HSW95] HSW93] It is obvious that properties of the language have an impact on the design process of an application. Therefore, there is as well a need for corresponding design principles which would allow smooth integration of the design and implementation phases. I have obtained ....

Gert Smolka. An Oz primer. DFKI Oz documentation series, DFKI, Stuhlsatzenhausweg 3, D-66123 Saarbrucken, Germany, 1995.

....ordinary numerical computation is a special case of interval constraint satisfaction. While the basic functionality is preserved, further computation domains can be tackled. 3. Extending classical Spreadsheets with FD Variables The numerical variables used so far, are replaced by Oz FD Variables [3], which means sets of positive integers. Formulas in cells describe the values of the corresponding variables, as before. A formula, representing a function in classical spreadsheets, denotes an equation between the variable and the arguments of the formula. In addition, there is a separate window ....

Gert Smolka, Ralf Treinen (ed.): DFKI Oz Documentation Series, 1994

....concerning the different CLP systems. As a result, we compared, as fairly as possible, eight different CLP systems on the finite domain and provided detailed results concerning the expressiveness, speed and robustness. Eight CLP systems were compared, four black box: ECL i PS e [1] Oz [42], the Ilog SOLVER [32] and B Prolog [46] and four glass box: clp(FD) 14] CHR [22] SICStus [24] and IF Prolog [31] To compare the expressiveness and ease of use, we used the self referential quiz (SRQ) which is one of a new class of puzzles first described in [25] We developed two ....

G. Smolka and R. Treinen. The Oz 2.0, User's Manual, DFKI Oz Documentation Series, 1995.

....is a conservative extension of OPM providing the problem solving capabilities of constraint logic programming. The resulting problem solvers appear as concurrent agents encapsulating search and speculative computation with constraints. Oz and OPM have been developed at the DFKI since 1991. Oz [25, 23, 22] is designed as a concurrent high level language that can replace sequential high level languages such as Lisp, Prolog and Smalltalk. There is no other concurrent language combining a rich object system with advanced features for symbolic processing and problem solving. First applications of Oz ....

....for shared memory machines has started. More ambitiously, we have also begun work towards a distributed version of Oz supporting the construction of open systems. This paper describes OPM in an informal manner. Calculi formalizing the major aspects of OPM can be found in [23, 22] The Oz Primer [25] is an introduction to programming in Oz. Basic implementation techniques for Oz are reported in [11] 2 Computation Spaces Computation in OPM takes place in a computation space hosting a number of tasks connected to a shared store. Computation advances by reduction of tasks. The reduction of a ....

[Article contains additional citation context not shown here]

G. Smolka. An Oz primer. DFKI Oz documentation series, DFKI, Saarbrucken, Germany, 1995.

No context found.

G. Smolka and R. Treinen (Eds.), DFKI Oz Documentation Series, DFKI, Saarbrucken, Germany, 1994.

No context found.

G. Smolka and R. Treinen (Eds.), DFKI Oz Documentation Series, DFKI, Saarbrucken, Germany, 1994.

No context found.

ST 95 Smolka, G.; Treinen, R. Eds. "DFKI Oz Documentation Series". Deutsches Forschungszentrum für Künstliche Intelligenz GmbH, Stuhlsatzenhausweg 3, 66123 Saarbrücken, Germany 1995.

No context found.

ST 95 Smolka, G.; Treinen, R. Eds. "DFKI Oz Documentation Series". Deutsches Forschungszentrum für Künstliche Intelligenz GmbH, Stuhlsatzenhausweg 3, 66123 Saarbrücken, Germany 1995.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC