1. W. Ackermann, 1954. Solvable Cases of the Decision Problem. North-Holland, Amsterdam.
2. A. Aiken and E. L. Wimmers, 1992. Solving Systems of Set Constraints (Extended Abstract). In Seventh Annual IEEE Symposium on Logic in Computer Science, Santa Cruz, California, USA, pp. 329–340. IEEE Computer Society Press.
3. LNAI 449;L. Bachmair,1990
4. L. Bachmair and H. Ganzinger, 1991. Rewrite-Based Equational Theorem Proving With Selection and Simplification. Technical Report MPI-I-91-208, Max-Planck-Institut für Informatik, Saarbrücken. Revised version to appear in Journal of Logic and Computation.
5. L. Bachmair, H. Ganzinger and U. Waldmann, 1992. Set Constraints are the Monadic Class. Technical Report MPI-I-92-240, Max-Planck-Institut für Informatik, Saarbrücken. Revised version to appear in Eighth Annual IEEE Symposium on Logic in Computer Science, Montreal, Canada, 1993.