1. A. Aiken and E. Wimmers. Solving systems of set constraints. In Proceedings of the Seventh Symposium on Logic in Computer Science, pages 329–340, Santa Cruz, CA, June 1992. IEEE.
2. Franz Baader. Rewrite systems for varieties of semigroups. In M. Stickel, editor, Proceedings of the Tenth International Conference on Automated Deduction (Kaiserslautern, West Germany), volume 449 of Lecture Notes in Computer Science, pages 381–395, Berlin, July 1990. Springer-Verlag.
3. Franz Baader and Klaus Schulz. Unification in the union of disjoint equational theories: Combining decision procedures. In D. Kapur, editor, Proceedings of the Eleventh International Conference on Automated Deduction (Saratoga Springs, NY), volume 607 of Lecture Notes in Artificial Intelligence, Berlin, June 1992. Springer-Verlag.
4. Franz Baader and Klaus Schulz. Combination techniques and decision problems for disunification. In C. Kirchner, editor, Proceedings of the Fifth International Conference on Rewriting Techniques and Applications (Montreal, Canada), Lecture Notes in Computer Science, Berlin, 1993. Springer-Verlag.
5. [Bachmair et al., 1993] Leo Bachmair, Harald Ganzinger, and Uwe Waldmann. Set constraints are the monadic class. In Proceedings of the Symposium on Logic in Computer Science (Montreal, Canada). IEEE, 1993.