Selected papers that cite this one
- Farid Ajili and Evelyne Contejean. Avoiding slack variables in the solving of linear diophantine equations and inequations. Theoretical Computer Science, 173(1):183-208, 20 February 1997.
- Franz Baader and Klaus U. Schulz. Combination of constraint solvers for free and quasi-free structures. Theoretical Computer Science, 192(1):107-161, 10 February 1998.
- Wray L. Buntine and Hans-Jürgen Bürckert. On solving equations and disequations. Journal of the ACM, 41(4):591-629, July 1994.
- H. Comon, R. Nieuwenhuis, and A. Rubio. Orderings, AC-theories and symbolic constraint solving (extended abstract). In Proceedings, Tenth Annual IEEE Symposium on Logic in Computer Science, pages 375-385, San Diego, California, 26-29 June 1995. IEEE Computer Society Press.
- Miki Hermann and Phokion G. Kolaitis. Unification algorithms cannot be combined in polynomial time. Accepted for publication in Information and Computation. Final manuscript received for publication September 15, 1998.
- Paliath Narendran, Frank Pfenning, and Richard Statman. On the unification problem for Cartesian closed categories. The Journal of Symbolic Logic, 62(2):636-647, June 1997.
- Tie-Cheng Wang. Z-module reasoning: An equality-oriented proving method with built-in ring axioms. Journal of the ACM, 40(3):558-606, July 1993.