1. A. Aiken, D. Kozen, M. Vardi, and E. Wimmers. The complexity of set constraints. In Proceedings of Computer Science Logic, 1993. Techn. Report 93-1352, Cornell University.
2. A. Aiken, D. Kozen, and E. Wimmers. Decidability of systems of set constraints with negative constraints. Technical Report 93-1362, Computer Science Department, Cornell University, 1993.
3. A. Aiken and E.L. Wimmers. Solving Systems of Set Constraints. In Proceedings of the 7
th
Symposium on LICS, pages 329–340, 1992.
4. L. Bachmair, H. Ganzinger, and U. Waldmann. Set constraints are the monadic class. In Proceedings of the 8
th
Symposium on LICS, pages 75–83, 1993.
5. W. Charatonik and L. Pacholski. Negative set constraints: an easy proof of decidability. In Proceedings of the 9
th
Symposium on LICS, 1994.