Witold Charatonik, Andreas Podelski  Home/Search
Context Related
| mpisb.mpg.de/~wito...independence.ps.Z Cached: PS.gz PS PDF 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.
Image Update HelpPS.gz PS PDF From: mpisb.mpg.de/~witold/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We investigate a class of set constraints that is used for the type analysis of concurrent constraint programs. Its constraints are inclusions between first-order terms (without set operators) interpreted over non-empty sets of finite trees. We show that this class has the independence property. We give a polynomial algorithm for entailment. The independence property is a fundamental property of constraint systems. It says that the constraints cannot express disjunctions, or, equivalently, that ... (Update)
Context of citations to this paper: More
...atomic set constraints) is DEXPTIME complete for an infinite signature. Beside this, they noted in the same paper with reference to [8] that entailment of atomic set constraints is decidable in polynomial time again for an infinite signature. We refute this claim and...
...was first investigated by Charatonik and Podelski. Beside their main results discussed below, they noted in [10] with reference to [9] that entailment of atomic set constraints is decidable in polynomial time, provided that an infinite signature is given. We refute this...
Cited by: More
Entailment of Set Constraints is not Feasible - Müller, Niehren (1997) (Correct)
Ordering Constraints over Feature Trees - Müller, Niehren (1999) (Correct)
Inclusion Constraints over Non-empty Sets of Trees - Müller, Niehren, Podelski (1997) (Correct)
Active bibliography (related documents): More All
0.7: Set Constraints with Intersection - Charatonik, Podelski (Correct)
0.3: Set Constraints: a Pearl in Research on Constraints - Pacholski, Podelski (1997) (Correct)
0.2: Constraint Logic Programming: A Survey - Jaffar, Maher (1994) (Correct)
Similar documents based on text: More All
0.5: Set-Based Failure Analysis for Logic Programs and.. - Podelski, Charatonik, .. (1999) (Correct)
0.4: Solving Set Constraints for Greatest Models - Charatonik, Podelski (1997) (Correct)
0.4: Set-based Error Diagnosis of Concurrent Constraint Programs - Podelski, Charatonik, Müller (1997) (Correct)
Related documents from co-citation: More All
9: Solving systems of set constraints with negated subset relationships (context) - Gilleron, Tison et al. - 1993
9: A decision procedure for a class of set constraints - Heintze, Jaffar - 1990
8: Set constraints are the monadic class - Bachmair, Ganzinger et al. - 1993
BibTeX entry: (Update)
W. Charatonik and A. Podelski. The independence property of a class of set constraints. In Proceedings of Conference on Principles and Practice of Constraint Programming (CP'96), pages 76--90. LNCS 1118, 1996. http://citeseer.ist.psu.edu/charatonik96independence.html More
@inproceedings{ charatonik96independence,
author = "Witold Charatonik and Andreas Podelski",
title = "The Independence Property of a Class of Set Constraints",
booktitle = "Principles and Practice of Constraint Programming",
pages = "76-90",
year = "1996",
url = "citeseer.ist.psu.edu/charatonik96independence.html" }
Citations (may not include all citations):561 Constraint logic programming (context) - Jaffar, Lassez - 1987
344 Concurrent Constraint Programming (context) - Saraswat - 1993
271 The Oz Programming Model - Smolka - 1995
165 Set based analysis of ML programs (context) - Heintze - 1993
157 Soft typing with conditional types - Aiken, Wimmers et al. - 1994
151 Logic semantics for a class of committed-choice programs (context) - Maher - 1987
131 Set based program analysis - Heintze - 1992
105 Records for Logic Programming - Smolka, Treinen - 1994
94 Equations and inequations on finite and infinite trees (context) - Colmerauer - 1984
82 A decision procedure for a class of set constraints - Heintze, Jaffar - 1990
76 Set constraints are the monadic class - Bachmair, Ganzinger et al. - 1993
57 The complexity of set constraints - Aiken, Kozen et al. - 1993
57 A logic programming view of CLP - Maher - 1993
52 Decidability of systems of set constraints with negative con.. - Aiken, Kozen et al. - 1993
50 Solving systems of set constraints with negated subset relat.. (context) - Gilleron, Tison et al. - 1993
44 Set constraints with projections are in NEXPTIME - Charatonik, Pacholski - 1994
42 Negative set constraints with equality - Charatonik, Pacholski - 1994
36 Logical aspects of set constraints - Kozen - 1993
33 A feature-based constraint system for logic programming with.. - Ait-Kaci, Podelski et al. - 1994
21 A constraint sequent calculus (context) - Lassez, McAloon - 1990
20 Logic programs as types for logic programs (context) - Fruhwirth, Shapiro et al. - 1991
16 Constraint-based query optimization for spatial databases - Helm, Marriott et al. - 1991
16 Inclusion constraints over non-empty sets of trees - Muller, Niehren et al.
10 Applications of a canonical form for generalized linear cons.. (context) - Lassez, McAloon - 1988
8 Type Analysis for a Higher-Order Concurrent Constraint Langu.. (context) - Muller - 1996
8 Entailment and disentailment of order-sorted feature constra.. (context) - Ait-Kaci, Podelski - 1993
8 Constrained dependencies - Maher - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.mpi-sb.mpg.de/~witold/): More
Solving Set Constraints for Greatest Models - Charatonik, Podelski (1997) (Correct)
Set-based Error Diagnosis of Concurrent Constraint Programs - Podelski, Charatonik, Müller (1997) (Correct)
Negative Set Constraints With Equality - Charatonik, Pacholski (1994) (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