@InProceedings{Niehren_et_al:1999,
      AUTHOR = {Niehren, Joachim and Müller, Martin and Talbot, Jean-Marc},
      TITLE = {Entailment of Atomic Set Constraints is PSPACE-Complete},
      YEAR = {1999},
      BOOKTITLE = {14th Annual IEEE Symposium on Logic in Computer Science (LICS '99), July 2-5},
      PAGES = {285-294},
      ADDRESS = {Trento, Italy},
      PUBLISHER = {IEEE Press},
      URL = {www.ps.uni-sb.de/Papers/abstracts/atomic:98.html ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/atomic-lics-99.ps.gz},
      ABSTRACT = {The complexity of set constraints has been extensively studied over the last years and was often found quite high. At the lower end of expressiveness, there are atomic set constraints which are conjunctions of inclusions t1 $subseteq$ t2 between first-order terms without set operators. It is well-known that satisfiability of atomic set constraints can be tested in cubic time. Also, entailment of atomic set constraints has been claimed decidable in polynomial time. We refute this claim. We show that entailment between atomic set constraints can express validity of quantified boolean formulas and is thus PSPACE hard. For infinite signatures, we also present a PSPACE-algorithm for solving atomic set constraints with negation. This proves that entailment of atomic set constraints is PSPACE-complete for infinite signatures. In case of finite signatures, this problem is even DEXPTIME-hard.},
      ANNOTE = {COLIURL : Niehren:1999:EAS.pdf Niehren:1999:EAS.ps}
}