Andreas Podelski and Gert Smolka. Situated simplification. In Proceedings of the First International Conference on Principles and Practice of Constraint Programming, LNCS, Marseille, France, September 1995. Springer-Verlag. To appear.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....place and maintaining a script of globally visible changes, supporting fast access to both local and global bindings. The globally visible changes are bindings of global variables. They are written to the script in the procedure bind. Other schemes for multiple constraint stores are known, e.g. [15, 13, 14]. Suppose that the current space is S 1 , and a task in a different space S 2 must be run. All constraints local to spaces between S 1 and the root must be removed, and all constraints between the root and S 2 must be made visible . Removal of constraints is called leaving , whereas making ....

Andreas Podelski and Gert Smolka. Situated simplification. In Proceedings of the First International Conference on Principles and Practice of Constraint Programming, LNCS, Marseille, France, September 1995. Springer-Verlag. To appear.

....strategies, including depth first, inde16 Final CCL Report 17 terministic one solution, demand driven multiple solution, all solutions, and best solution (branch and bound) search. Testing satisfaction of guards is the essential operation of concurrent constraint programming (CCP) systems. In [82] an incremental algorithm for the simultaneous tests of entailment and disentailment of rational tree constraints, to be used in CCP systems with deep guards (e.g. AKL or Oz) is presented and proven correct. The algorithm is presented as the simplification of the constraints which form the ....

....visits, lectures, seminars within the working group Common work with UPS on symbolic ordering constraints is published in [34] Ralf Treinen, from DFKI, is now working at UPS. We are also in close collaboration with the Max Planck Institut fur Informatik on constraint based programming paradigms [80, 82]. 6.3 Implementations Oz is a concurrent constraint programming language designed for applications that require complex symbolic computations, organization into multiple agents, and soft real time control. It is based on a new computation model [98] providing a uniform foundation for ....

[Article contains additional citation context not shown here]

Andreas Podelski and Gert Smolka. Situated simplification. In Ugo Montanari, editor, Proceedings of the First International Conference on Principles and Practice of Constraint Programming, Lecture Notes in Computer Science, pages 328--344, Cassis, France, 19--22 September 1995. Springer-Verlag.

....i.e. all the subsorts. In general, full lookahead is obviously a great deal more expensive than partial lookahead. 6 Efficient Implementation We presuppose a system which performs incremental checking of entailment and disentailment simultaneously, e.g. using relative or situated simplification [5, 6]. x in E x can be viewed as a status of necessity associated with the store in which E is being simplified. When this status is set to , all local bindings are promoted to the top level and all suspended guards in the store are promoted as top level goals. ....

Andreas Podelski and Gert Smolka. Situated simplification. In Proceedings of CP95, 1995.

....has become unstable it will be marked as unstable even if it later becomes stable. A similar scheme is used in the DFKIOZ system but the stability check has been limited to and nodes immediately below solve combinators. Andreas Podelski and Gert Smolka has presented situated simplification [8] that is a formal description of a system that is similar to the Penny binding scheme. The description differs mainly in that the local binding of a variable is accessed through the variable using the environment as an index. This is of course an implementation decision but to determine stability ....

A. Podelski and G. Smolka. Situated simplification. In U. Montanari, editor, Proceedings of the 1st Conference on Principles and Practice of Constraint Programming, Lecture Notes in Computer Science, vol. 976, pages 328--344, Cassis, France, September 1995. Springer-Verlag.

....has become unstable it will be marked as unstable even if it later becomes stable. A similar scheme is used in the DFKIOZ system but the stability check has been limited to and nodes immediately below solve combinators. Andreas Podelski and Gert Smolka has presented situated simplification [51] that is a formal description of a system that is similar to the Penny binding scheme. The description differs mainly in that the local binding of a variable is accessed through the variable using the environment as an index. This is of course an implementation decision but to determine stability ....

A. Podelski and G. Smolka. Situated simplification. In U. Montanari, editor, Proceedings of the 1st Conference on Principles and Practice of Constraint Programming, Lecture Notes in Computer Science, vol. 976, pages 328--344, Cassis, France, September 1995. Springer-Verlag.

....to avoid non termination. For dependency management the syntactical equations are marked with labels representing their justifications. The labeling technique originates from truth maintenance [9, 17] however, the used labels are simpler. Several incremental entailment algorithms are known (e.g. [14 16]) They have in common that only the iterative additions of syntactical equations are supported not their deletions. In contrast to these algorithms our algorithm supports both dynamical aspects: Arbitrary additions and deletions of syntactical equations are incrementally managed. After a ....

Andreas Podelski and Gert Smolka. Situated simplification. In Principles and Practice of Constraint Programming --- CP'95, number 976 in Lecture Notes in Computer Science, pages 328--344, 1995.

....rational trees, i.e. trees with only finitely many subtrees. A rational tree is a good model for data structures with pointers since the tree can be represented (though not uniquely represented) by a rooted directed graph. Unfolding the graph to remove its cycles yields the tree [Courcelle 1983; Podelski and Smolka 1997]. The constraints C model bindings; we assume they are equalities between terms that describe sets of rational trees. For example, the constraint x = f(y) means that the trees described by the variable x all have a root labeled f and a single subtree, which is a tree described by the variable y. ....

Podelski, A. and Smolka, G. 1997. Situated simplification. Theoretical Computer Science 173, 209--233.

No context found.

Andreas Podelski and Gert Smolka. Situated simplification. In Ugo Montanari and Francesca Rossi, editors, Proceedings of the First International Conference on Principles and Practice of Constraint Programming, Lecture Notes in Computer Science, vol. 976, pages 328--344, Cassis, France, 19--22 September 1995. Springer-Verlag.

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