## Entailment of Set Constraints is not Feasible (1997)

by
Martin Müller
,
Joachim Niehren

Venue: | Programming Systems Lab, Universitat des Saarlandes |

Citations: | 3 - 2 self |

### BibTeX

@TECHREPORT{Müller97entailmentof,

author = {Martin Müller and Joachim Niehren},

title = {Entailment of Set Constraints is not Feasible},

institution = {Programming Systems Lab, Universitat des Saarlandes},

year = {1997}

}

### OpenURL

### Abstract

Set constraints are inclusions between expressions denoting sets of trees. They have been used extensively for type inference and program analysis. At the lower end of the expressiveness scale there are atomic set constraints and Ines constraints (inclusions over non-empty sets) for both of which a cubic time satisfiability test is known. Recently, there has been increasing interest in entailment tests for set constraints.