Andreas Podelski, Gert Smolka  Home/Search
Context Related
| ps.unisb.de/Papers/a...SituSimpli95.ps Cached: PS.gz PS This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PDF Image Update HelpPS.gz PS From: ps.unisb.de/Papers/abstracts/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Testing satisfaction of guards is the essential operation of concurrent constraint programming (CCP) systems. We present and prove correct, for the first time, 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). The algorithm is presented as the simplification of the constraints which form the (possibly deep) guards and which are situated at different nodes (or,... (Update)
Context of citations to this paper: More
.... 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...
...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...
Cited by: More
An Abstract Machine for Oz - Mehl, al. (1995) (Correct)
Efficient Logic Variables for Distributed Computing - Haridi, Van Roy, Brand.. (Correct)
Final CCL report - Jouannaud (Correct)
Similar documents (at the sentence level):
76.8%: Situated Simplification - Podelski, Smolka (1995) (Correct)
Active bibliography (related documents): More All
0.2: A Calculus for Higher-order Concurrent Constraint Programming.. - Smolka (1994) (Correct)
0.2: Programming Constraint Services - Schulte (2002) (Correct)
0.2: Guarded Constraints in Natural Language - Kathryn Baker July (Correct)
Similar documents based on text: More All
0.7: The Beauty and Beast Algorithm: Quasi-Linear Incremental.. - Podelski, van Roy (1994) (Correct)
0.6: Entailment and Disentailment of Order-Sorted Feature.. - Aït-Kaci, Podelski (1993) (Correct)
0.5: Equational and Membership Constraints for Infinite Trees - Niehren, Podelski, Treinen (1993) (Correct)
Related documents from co-citation: More All
6: The beauty and beast algorithm: Quasi-linear incremental tests of entailment and.. - Podelski, Van Roy - 1994
4: The first-order theory of lexicographic path orderings is undecidable - Comon, Treinen - 1997
4: Encapsulated search in higher-order concurrent constraint programming - Schulte, Smolka - 1994
BibTeX entry: (Update)
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. http://citeseer.ist.psu.edu/podelski95situated.html More
@article{ podelski97situated,
author = "Andreas Podelski and Gert Smolka",
title = "Situated simplification",
journal = "Theoretical Computer Science",
volume = "173",
number = "1",
pages = "235--252",
year = "1997",
url = "citeseer.ist.psu.edu/podelski95situated.html" }
Citations (may not include all citations):247 The family of concurrent logic programming languages (context) - Shapiro - 1989
151 Logic semantics for a class of committed-choice programs (context) - Maher - 1987
114 Fundamental properties of infinite trees (context) - Courcelle - 1983
101 Concurrent constraint programming (context) - Saraswat, Rinard - 1990
72 Kernel Andorra Prolog and its computation model - Haridi, Janson - 1990
36 Oz---a programming language for multi-agent systems - Henz, Smolka et al. - 1993
25 A relational language for parallel programming (context) - Clark, Gregory - 1981
22 Operational semantics of constraint logic programming with c.. - Podelski, Smolka - 1995
21 Prolog II reference manual and theoretical model (context) - Colmerauer - 1982
18 Automating control for logic programs (context) - Naish - 1985
15 Department of Computer Science (context) - Naish, db et al. - 1985
12 Towards a meaning of LIFE - Ait-Kaci, Podelski - 1991
11 A feature-based constraint system for logic programming with.. - Ait-Kaci, Podelski et al. - 1994
10 Deutsches Forschungszentrum fur Kunstliche Intelligenz (context) - Henz, Mehl et al. - 1994
9 The Beauty and the Beast algorithm: Quasilinear incremental .. - Podelski, Van Roy - 1994
4 andor parallel implementation AKL - Montelius, An et al. - 1995
4 Functions as passive constraints in life - Ait-Kaci, Podelski - 1994
1 This article was processed using the L a T E X macro package.. (context) - Smolka, Treinen et al. - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.ps.uni-sb.de/Papers/abstracts/): More
Set-Based Failure Analysis for Logic Programs and.. - Podelski, Charatonik, .. (1999) (Correct)
Type Inference for First-Class Messages with Feature Constraints - Müller, Nishimura (Correct)
Entailment of Non-Structural Subtype Constraints - Niehren, Priesnitz (1999) (Correct)
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