Joachim Niehren, Tim Priesnitz  Home/Search
Context Related
| ps.unisb.de/Paper...peEntailment:99.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: Entailment of subtype constraints was introduced for constraint simplification in subtype inference systems. Designing an efficient algorithm for subtype entailment turned out to be surprisingly difficult. The situation was clarified by Rehof and Henglein who proved entailment of structural subtype constraints to be coNP-complete for simple types and PSPACE-complete for recursive types. For entailment of non-structural subtype constraints of both simple and recursive types they proved... (Update)
Context of citations to this paper: More
.... years, the exact complexity and even the decidability of entailment is open for non structural subtyping constraints [3, 13, 14, 18, 19, 23, 28, 29, 34, 35, 37, 43]. As we show in Section 2, the natural versions of entailment and subtyping constrained types can be encoded...
...explain why finding a decision procedure for NSSE is so difficult. On the other hand, only a fragment of NSSE could be proved decidable [15] (and PSPACEcomplete) The idea behind the approach of this paper is to first reformulate Rehof and Henglein s approach for structural...
Cited by: More
Subtype Constraints in Modal Logic - Niehren, Priesnitz (2005) (Correct)
The First-Order Theory of Subtyping Constraints - Su, Aiken, Niehren, Priesnitz (Correct)
Non-Structural Subtype Entailment in Automata Theory - Niehren, Priesnitz (2001) (Correct)
Active bibliography (related documents): More All
0.4: The First-Order Theory of Ordering Constraints over Feature .. - Müller, Niehren, Treinen (Correct)
0.3: Tree Extension Algebras: Logics, Automata, and Query Languages - Benedikt, Libkin (Correct)
0.3: First-Order Theory of Subtyping Constraints - Su, Aiken, Niehren, Priesnitz (Correct)
Similar documents based on text: More All
1.2: Constraint Automata and the Complexity of Recursive Subtype.. - Henglein, Rehof (1998) (Correct)
1.0: The Complexity of Subtype Entailment for Simple Types - Henglein, Rehof (1997) (Correct)
0.8: The Complexity of Simple Subtyping Systems - Rehof (1998) (Correct)
Related documents from co-citation: More All
5: Constraint automata and the complexity of recursive subtype entailment - Henglein, Rehof - 1998
5: The Complexity of Subtype Entailment for Simple Types - Henglein, Rehof - 1997
5: ACM Transactions on Programming Languages and Systems (context) - Amadio, Cardelli et al. - 1993
BibTeX entry: (Update)
J. Niehren and T. Priesnitz. Entailment of NonStructural Subtype Constraints. In Asian Computing Science Conference, number 1742 in LNCS, pages 251{ 265. Springer, December 1999. http://citeseer.ist.psu.edu/article/niehren99entailment.html More
@inproceedings{ niehren99entailment,
author = "Joachim Niehren and Tim Priesnitz",
title = "Entailment of Non-structural Subtype Constraints",
booktitle = "Asian Computing Science Conference",
pages = "251-265",
year = "1999",
url = "citeseer.ist.psu.edu/article/niehren99entailment.html" }
Citations (may not include all citations):229 Foundations for Programming Languages (context) - Mitchell - 1996
129 ACM Transactions on Programming Languages and Systems (context) - Amadio, Cardelli et al. - 1993
105 Records for logic programming - Smolka, Treinen - 1994
85 Type inference with simple subtypes (context) - Mitchell - 1991
76 Type inference for recursively constrained types and its app.. - Eifrig, Smith et al. - 1995
72 Sound polymorphic type inference for objects - Eifrig, Smith et al. - 1995
68 Subtyping constrained types - Trifonov, Smith - 1996
52 Simplifying subtyping constraints - Pottier - 1996
38 Set constraints with intersection - Charatonik, Podelski - 1997
31 On subsumption and semiunification in feature algebras (context) - Dorre, Rounds - 1990
30 Theoretical Computer Science (context) - Fuh, Mishra et al. - 1990
29 The complexity of subtype entailment for simple types - Henglein, Rehof - 1997
21 A feature-based constraint system for logic programming with.. (context) - At-Kaci, Podelski et al. - 1994
19 Minimal typings in atomic subtyping - Rehof - 1997
17 A framework for type inference with subtyping - Pottier - 1998
15 Type inference in the presence of subtyping: from theory to .. (context) - Pottier - 1998
14 Feature logics with weak subsumption constraints - Dorre - 1991
13 Constraint automata and the complexity of recursive subtype .. - Henglein, Rehof - 1998
13 The Complexity of Simple Subtyping Systems - Rehof - 1998
11 Entailment of atomic set constraints is PSPACE-complete - Niehren, Muller et al. - 1999
9 The first-order theory of ordering constraints over feature .. (context) - Muller, Niehren et al. - 1998
7 Ordering constraints over feature trees (context) - Muller, Niehren et al. - 2000
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)
Smallest Horn Clause Programs - Devienne, Lebègue, Parrain.. (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