Systems of Set Constraints with Negative Constraints are NEXPTIME-Complete

Kjartan Stefánsson. Systems of Set Constraints with Negative Constraints are NEXPTIME-Complete. In Proceedings, Ninth Annual IEEE Symposium on Logic in Computer Science, 4-7 July 1994, Paris, France. pages 137-141, IEEE Computer Society, 1994.

Abstract

Abstract is missing.