Entailment of Atomic Set Constraints is PSPACE-Complete

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

• Type: Conference
• Year: 1999
• Where: LICS
• Authors: Joachim Niehren, Martin Müller, Jean-Marc Talbot
• Keywords: Atomic Set Constraints, Automated Reasoning, Entailment, LICS 1999, Set Operators