Entailment of Atomic Set Constraints is PSPACE-Complete - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 1999

Entailment of Atomic Set Constraints is PSPACE-Complete

Résumé

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.
Fichier principal
Vignette du fichier
atomic-lics-99.pdf (144.55 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00536817 , version 1 (18-11-2010)

Identifiants

  • HAL Id : inria-00536817 , version 1

Citer

Joachim Niehren, Martin Müller, Jean-Marc Talbot. Entailment of Atomic Set Constraints is PSPACE-Complete. Fourteenth Annual IEEE Symposium on Logic in Computer Sience, 1999, Trento, Italy. pp.285--294. ⟨inria-00536817⟩
76 Consultations
134 Téléchargements

Partager

Gmail Facebook X LinkedIn More