Journal of the ACM Bibliography
Gerald E. Peterson and Mark E. Stickel. Complete sets
of reductions for some equational theories. Journal of the
ACM, 28(2):233-264, April 1981.
[BibTeX entry]
Selected papers that cite this one
- Franz Baader. Combination of compatible
reduction orderings that are total on ground terms. In
Proceedings, Twelth Annual IEEE Symposium on Logic in Computer
Science, pages 2-13, Warsaw, Poland, 29 June-2 July 1997. IEEE
Computer Society Press.
- Leo Bachmair and Nachum Dershowitz. Equational inference, canonical
proofs, and proof orderings. Journal of the ACM,
41(2):236-276, March 1994.
- Reinhard Bündgen. Buchberger's algorithm:
The term rewriter's point of view. Theoretical Computer
Science, 159(2):143-190, 3 June 1996. Fundamental Study.
- 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. Linnestad. Fatal Steps
of Knuth-Bendix Completion Nordic Journal of Computing,
3(2):131-143, Summer 1996.
- Claude Marché Normalised rewriting and
normalised completion. In Proceedings, Ninth Annual IEEE
Symposium on Logic in Computer Science, pages 394-403, Paris,
France, 4-7 July 1994. IEEE Computer Society Press.
- N. Lafaye de Micheaux and C. Rambaud. Confluence for graph
transformations. Theoretical Computer Science,
154(2):329-348, 5 February 1996.
- 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.
- Jürgen Stuber. Superposition theorem
proving for abelian groups represented as integer modules.
Theoretical Computer Science, 208(1-2):149-177, 28 November
1998.
- Uwe Waldmann. Extending reduction
orderings to ACU-compatible reduction orderings. Information
Processing Letters, 67(1):43-49, 16 July 1998.
- 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.
Shortcuts: