Tobias Muller, Konstantin Popow, Christian Schulte, and Jorg Wurtz. Constraint programming in Oz. DFKI Oz documentation series, German Research Center for Artificial Intelligence (DFKI), Stuhlsatzenhausweg 3, D-66123 Saarbr ucken, Germany, 1994.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....of AGENTS versus clp(FD) 10.2 Evaluating AGENTS with Copying In this section we are using the copying scheme for labeling developed in Section 9.5.1. 10.2. 1 Comparing with Oz We now compare AGENTS with Oz, which offers the same basic functionality for finite domain constraints as do AGENTS [Smo95, HM95, MMPS95, MPSW95]. The machine used throughout in the evaluation is a Sun 4 25 (SPARCstation ELC) running SunOs 4.1.2, and all measurements are done on this machine. In Table 10.9 we give the timings in milliseconds for the same programs run in AGENTS and in Oz. This time, we use the copying based backtracking ....

....i.e. a computation can be made to suspend (block) until a certain constraint is entailed by the store, i.e. until each solution of the store is a solution of the constraint. Entailment checking as used in CCP languages also provides a good mechanism for control in user defined constraints [HSD91, CJH94, MPSW95]. 140 Related Work ffl Communication is handled by adding (telling) constraints to the store, which increases the amount of information in the store. Thus, by making two processes share variables, one process can suspend through a constraint on a variable x say, until the other process adds a ....

[Article contains additional citation context not shown here]

T. Muller, K. Popov, C. Schulte, and J. Wurtz. Constraint Programming in Oz. Oz Documentation Series, DFKI, German Research Center for Artificial Intelligence, 1995.

.... placement problems in realistic domains because of their increased runtime and the required memory capacity, especially when they are restricted to the use of constraint techniques only although they have already proven their adequacy for such problem classes for academic examples (cf. Muller et al. 1995 ] and thus cannot compete with specialized layout algorithms. Therefore, the CHIP sytem [ Van Hentenryck, 1989 ] has been extended by a new primitive constraint in finite domains, the so called cumulative constraint [ Aggoun and Beldiceanu, 1993 ] that allows an improvement in the ....

Tobias Muller, Konstantin Popov, Christian Schulte, and Jorg Wurtz. Constraint Programming in Oz. DFKI Oz Documentation Series, Programming Systems Lab, German Research Center for Artificial Intelligence, Saarbrucken, December 11, 1995. ftp://ps-ftp.dfki.unisb. de/pub/oz/documentation/ConstraintProgramming.ps.Z.

.... [8] ffl The Oz Standard Modules [3] ffl The Oz Notation [1] Moreover, DFKI Oz implements the functionality defined in this document, and also the functionality defined in the documents ffl Window Programming in DFKI Oz [4] ffl Open Programming in DFKI Oz [7] ffl Constraint Programming in Oz [5]. Some of the functionality described in Constraint Programming in Oz is still experimental; it will become official part of the Oz language when finalized. Tutorial introductions to Oz are [9, 2] Architecture. The main components of DFKI Oz are a programming interface based on the GNU Emacs ....

....The procedure Show is useful for debugging. No cycle detection is implemented, but the print depth is limited (see System.getPrintDepth, System.setPrintDepth) The output of a variable might be appropriately annotated: If the variable is contrained to a finite domain of integers (see [1] or [5]) or if there are actors waiting for the variable to get further constrained. showBuiltins The list of all builtins is displayed in the buffer Oz Emulator , together with some statistics about the hashtable containing the builtins. showError VS The virtual string VS , followed by a ....

Tobias Muller, Konstantin Popow, Christian Schulte, and Jorg Wurtz. Constraint programming in Oz. DFKI Oz documentation series, German Research Center for Artificial Intelligence (DFKI), Stuhlsatzenhausweg 3, D-66123 Saarbr ucken, Germany, 1994.

....very heart. This is, aspects of concurrency show up in functional programming (in suspension and different evaluation strategies) in object oriented programming (in communication through logic variables and suspension on message receipt) and constraint programming which is reported on elsewhere [14]. But there is also specific support for concurrent programming, for example through time for reactive and animated programming, threads as the basic unit of fair execution, and priorities. The plan of this report is as follows: Section 2 explains functional programming in Oz. The object part of ....

....by encoding into the following simple conditionals: 1 The reader expecting an if instead of a case here should note that full Oz is a also deep guard language, where deep guards are introduced with if. case is used as the functional counterpart of if. Some more will be said in Section 2. 9 and in [14]. January 23, 1995 DRAFT 6 2 FUNCTIONAL PROGRAMMING case T1 then T2 else False = T1 andthen T2 case T1 then True else T2 = T1 orelse T2 2.2.4 Equality There are two notions of equality in Oz: Assertion and test. The expression X=Y Z=5 asserts that X and Y have the same value and that ....

[Article contains additional citation context not shown here]

Tobias Muller, Konstantin Popow, Christian Schulte, and Jorg Wurtz. Constraint programming in Oz. DFKI Oz documentation series, German Research Center for Artificial Intelligence (DFKI), Stuhlsatzenhausweg 3, D-66123 Saarbr ucken, Germany, 1994.

....and solving the problem of mutual dependencies between already existing appointments. So we equip the PASHA with a local planner who is able to find those time slots. We formulate this task as a finite domain constraint problem as a first step. As the syntax of the Finite Domain Module (cf. [6]) in Oz provides us with a lot of interesting features the process of finding free time slots turns out to be merely an application of these features after choosing an appropriate time representation. In our application domain we represent time as a set of integers with the granularity of one ....

....to concentrate on a typical scheduling problem: the computation of a job shop scheduling. FESTUS s main resources are rooms and he has to assign for each meeting the appropriate room. So we formulate this task as a finite domain constraint problem and then use the Constraint Problem Solver (cf. [6]) provided by Oz to solve this scheduling problem. After choosing a room the user will be informed about the location of the meeting via email. This can easily achieved by using the Oz Unix Interface (cf. 7] All these together with the requirement to employ a programming environment suitable ....

Tobias Muller, Konstantin Popow, Christian Schulte, and Jorg Wurtz. Constraint programming in Oz. DFKI Oz documentation series, German Research Center for Artificial Intelligence (DFKI), D-66123 Saarbrucken, Germany, 1994.

....concurrent programming. Further Reading The DFKI Oz Documentation Series currently consists of 10 documents offering more than 600 pages of tutorial and defining material. The document ffl An Oz Primer [this paper] is a tutorial introduction to Oz. The document ffl Constraint Programming in Oz [15] is a mainly tutorial presentation of constraint programming in Oz. The document ffl Programming in Oz [7] covers advanced programming techniques, excluding constraint programming. The documents ffl DFKI Oz User s Manual [13] ffl Window Programming in DFKI Oz [12] ffl Open Programming in DFKI ....

....computation with constraints taking place in local computation spaces. Branching is postponed until a stability condition is met. There is no backtracking. All search abstractions are obtained from a single higher order search combinator. Constraint programming in Oz is described in the document [15]. DRAFT April 27, 89 11 Interoperability DFKI Oz comes with powerful interoperability features. High level socket functionality is provided through predefined classes, making it straightforward to connect applications written in other languages, possibly running on different computers. Starting ....

Tobias Muller, Konstantin Popow, Christian Schulte, and Jorg Wurtz. Constraint programming in Oz. DFKI Oz documentation series, German Research Center for Artificial Intelligence (DFKI), Stuhlsatzenhausweg 3, D-66123 Saarbr ucken, Germany, 1994.

....This report gives a complete and concise definition of Kernel Oz. Supplementary literature is needed to understand the language design and programming in Oz. The reader is expected to have an intuitive understanding of Oz, as conveyed by [14] More thorough introductions to programming in Oz are [5, 9]. The document [4] defines Oz by reduction to Kernel Oz. On first reading, we recommend to ignore the constraint programming aspects of Oz (disjunctions, solvers, finite domains) The study of the Oz calculus should be prepared by reading [13] which introduces a simplified calculus not covering ....

Tobias Muller, Konstantin Popow, Christian Schulte, and Jorg Wurtz. Constraint programming in Oz. DFKI Oz documentation series, German Research Center for Artificial Intelligence (DFKI), Stuhlsatzenhausweg 3, D-66123 Saarbr ucken, Germany, 1994.

.... [8] ffl The Oz Standard Modules [3] ffl The Oz Notation [1] Moreover, DFKI Oz implements the functionality defined in this document, and also the functionality defined in the documents ffl Window Programming in DFKI Oz [4] ffl Open Programming in DFKI Oz [7] ffl Constraint Programming in Oz [5]. Some of the functionality described in Constraint Programming in Oz is still experimental; it will become official part of the Oz language when finalized. Tutorial introductions to Oz are [9, 2] Architecture. The main components of DFKI Oz are a programming interface based on the GNU Emacs ....

....given value. January 24, 1995 DRAFT 16 4 BROWSER 4.1. 3 Browsed Values Oz Browser can textually represent all elements of the Oz Universe, called values [8] variables, all partial values which are obtained from values by replacing their components with variables, and finite domain constraints [5]. In the scope of the Oz Browser documentation, these entities are called terms, and all their components are called subterms. Variables are shown by their print names, which are obtained by the component getPrintName of the module System (see the section 5 of this manual) Additionally, certain ....

Tobias Muller, Konstantin Popow, Christian Schulte, and Jorg Wurtz. Constraint programming in Oz. DFKI Oz documentation series, German Research Center for Artificial Intelligence (DFKI), Stuhlsatzenhausweg 3, D-66123 Saarbr ucken, Germany, 1994.

No context found.

Tobias Muller, Konstantin Popow, Christian Schulte, and Jorg Wurtz. Constraint programming in Oz. DFKI Oz documentation series, German Research Center for Artificial Intelligence (DFKI), Stuhlsatzenhausweg 3, D-66123 Saarbr ucken, Germany, 1994.

....This report gives a complete and concise definition of Kernel Oz. Supplementary literature is needed to understand the language design and programming in Oz. The reader is expected to have an intuitive understanding of Oz, as conveyed by [14] More thorough introductions to programming in Oz are [5, 9]. The document [4] defines Oz by reduction to Kernel Oz. On first reading, we recommend to ignore the constraint programming aspects of Oz (disjunctions, solvers, finite domains) The study of the Oz calculus should be prepared by reading [13] which introduces a simplified calculus not covering ....

Tobias Muller, Konstantin Popow, Christian Schulte, and Jorg Wurtz. Constraint programming in Oz. DFKI Oz documentation series, German Research Center for Artificial Intelligence (DFKI), Stuhlsatzenhausweg 3, D-66123 Saarbr ucken, Germany, 1994.

....in Oz is factorised into two orthogonal components: specifying the problem and the search strategy to solve the problem. Rather than providing a single built in search strategy, in Oz different search strategies can be obtained from a single primitive, called solve combinator [10] 11] 3] [7]. The Oz Solver uses this primitive to implement an interactive search strategy. Instead of using a search strategy like depth first or branch and bound search, the Oz Solver can be used without making any changes to the problem to be solved. The Solver is written completely in Oz, which testifies ....

Tobias Muller, Konstantin Popov, Christian Schulte, and Jorg Wurtz. Constraint programming in Oz. DFKI Oz documentation series, German Research Center for Artificial Intelligence (DFKI), Stuhlsatzenhausweg 3, D-66123 Saarbrucken, Germany, 1994.

....a problem solver in Oz is factorised into two orthogonal components: specifying the problem and the search strategy to solve the problem. Rather than providing a single built in search strategy, in Oz different search strategies can be obtained from a single primitive, called solve combinator [10, 11, 3, 7]. The Oz Solver uses this primitive to implement an interactive search strategy. Instead of using a search strategy like depth first or branch and bound search, the Oz Solver can be used without making any changes to the problem to be solved. The Solver is written completely in Oz, which testifies ....

Tobias Muller, Konstantin Popov, Christian Schulte, and Jorg Wurtz. Constraint programming in Oz. DFKI Oz documentation series, German Research Center for Artificial Intelligence (DFKI), Stuhlsatzenhausweg 3, D-66123 Saarbr ucken, Germany, 1994.

....to search is described. It can be seen as a more powerful version of a Prolog toplevel: multiple solutions (and also previous ones) may be requested, the depth of the search may be bounded, and the search process itself may be stopped and resumed. For a more detailed treatment of search in Oz see [9]. 4.1 Solve The module Solve contains several predefined procedures implementing some common search strategies. SolveCombinator P T Provides access to the basic search mechanism of Kernel Oz. Its definition may be found in [11] One Solution Search The submodule Solve.one provides the ....

....constraints, Oz provides also for intervalconsistency and entailment. A propagator resulting from an infix expression suspends until all occurring variables are constrained to finite domains and the terms are linear. For a more detailed description of the semantics and how to use constraints see [9]. 5.1 FD 49 5.1 Basic Constraints FiniteDomain D FD.fd=FiniteDomain D is constrained to a finite domain, i.e. D may be bound to an integer between 0 and FD.bound. dom X D D is constrained to a finite domain specified by X , which must be an integer, a pair of integers (denoting a range) ....

[Article contains additional citation context not shown here]

Tobias Muller, Konstantin Popow, Christian Schulte, and Jorg Wurtz. Constraint programming in Oz. DFKI Oz documentation series, German Research Center for Artificial Intelligence (DFKI), Stuhlsatzenhausweg 3, D-66123 Saarbr ucken, Germany, 1994.

....allows you to choose certain predefined problems. 3.3 Scheduling This program demonstrates how scheduling may be realized in Oz. Assume that we have some machines and several jobs consisting of tasks that should run on certain machines. We have two kinds of constraints (for more information see [7]) First there are precedence constraints that one task has to be finished before another task can be started. Second there are resource constraints stating that two tasks needing the same machine must not run at the same time. The aim is to find an allocation of machines such that the overall ....

....the right window. 3.5 Oz Queens This demo shows the application of finite domain constraints and search to the famous n Queens problem: how to place n Queens on a n Theta n chess board such that the queens do not attack each other. The underlying formulation of the algorithm is as presented in [7] using finite domain constraints. The demo shows how constraint propagation does work and how different search strategies may influence the search process. After feeding the program, a window like shown in the left part of Figure 3.5. Whenever the button Next is clicked, it is tried to place the ....

Tobias Muller, Konstantin Popow, Christian Schulte, and Jorg Wurtz. Constraint programming in Oz. DFKI Oz documentation series, German Research Center for Artificial Intelligence (DFKI), Stuhlsatzenhausweg 3, D-66123 Saarbr ucken, Germany, 1994.

....to search is described. It can be seen as a more powerful version of a Prolog toplevel: multiple solutions (and also previous ones) may be requested, the depth of the search may be bounded, and the search process itself may be stopped and resumed. For a more detailed treatment of search in Oz see [9]. 4.1 Solve The module Solve contains several predefined procedures implementing some common search strategies. SolveCombinator P T Provides access to the basic search mechanism of Kernel Oz. Spawns a local computation space in which the unary procedure P is applied to a fresh root variable. ....

....constraints, Oz provides also for interval consistency and entailment. A propagator resulting from an infix comparison suspends until all occurring variables are constrained to finite domains and the terms are linear. For a more detailed description of the semantics and how to use constraints see [9]. 48 5.2 FD 5.1 Basic Constraints FiniteDomain D FD.fd=FiniteDomain D is constrained to a finite domain, i.e. D may be bound to an integer between 0 and FD.bound. dom X D D is constrained to a finite domain specified by X , which must be an integer, a pair of integers (denoting a range) ....

[Article contains additional citation context not shown here]

Tobias Muller, Konstantin Popow, Christian Schulte, and Jorg Wurtz. Constraint programming in Oz. DFKI Oz documentation series, German Research Center for Artificial Intelligence (DFKI), Stuhlsatzenhausweg 3, D-66123 Saarbr ucken, Germany, 1994.

....and theoretical foundations. Further Reading The DFKI Oz Documentation Series currently consists of 10 documents offering more than 600 pages of tutorial and defining material. The document ffl An Oz Primer [15] is a tutorial introduction to Oz. The document ffl Constraint Programming in Oz [8] is a mainly tutorial presentation of constraint programming in Oz. The document ffl Programming in Oz [2] covers advanced programming techniques, excluding constraint programming. The documents ffl DFKI Oz User s Manual [6] ffl Window Programming in DFKI Oz [5] ffl Open Programming in DFKI Oz ....

Tobias Muller, Konstantin Popow, Christian Schulte, and Jorg Wurtz. Constraint programming in Oz. DFKI Oz documentation series, German Research Center for Artificial Intelligence (DFKI), Stuhlsatzenhausweg 3, D-66123 Saarbrucken, Germany, 1994.

No context found.

Tobias Muller, Konstantin Popov, Christian Schulte, and Jorg Wurtz. Constraint Programming in Oz. DFKI Oz Documentation Series, Programming Systems Lab, German Research Center for Artificial Intelligence, Saarbrucken, June 28, 1995. http://pswww. dfki.uni-sb.de/oz/documentation/#constraints.

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