MPI-INF/SWS Research Reports 1991-2021

2. Number - All Departments


Atomic set constraints with projection

Charatonik, Witold and Talbot, Jean-Marc

May 2002, 20 pages.

Status: available - back from printing

We investigate a class of set constraints defined as atomic set constraints augmented with projection. This class subsumes some already studied classes such as atomic set constraints with left-hand side projection and INES constraints. All these classes enjoy the nice property that satisfiability can be tested in cubic time. This is in contrast to several other classes of set constraints, such as definite set constraints and positive set constraints, for which satisfiability ranges from DEXPTIME-complete to NEXPTIME-complete. However, these latter classes allow set operators such as intersection or union which is not the case for the class studied here. In the case of atomic set constraints with projection one might expect that satisfiability remains polynomial. Unfortunately, we show that that the satisfiability problem for this class is no longer polynomial, but CoNP-hard. Furthermore, we devise a PSPACE algorithm to solve this satisfiability problem.

  • Attachement: (176 KBytes)

URL to this document:

Hide details for BibTeXBibTeX
  AUTHOR = {Charatonik, Witold and Talbot, Jean-Marc},
  TITLE = {Atomic set constraints with projection},
  TYPE = {Research Report},
  INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
  ADDRESS = {Stuhlsatzenhausweg 85, 66123 Saarbr{\"u}cken, Germany},
  NUMBER = {MPI-I-2002-2-008},
  MONTH = {May},
  YEAR = {2002},
  ISSN = {0946-011X},