Advertisement

Obtaining complete sets of reductions and equations without using special unification algorithms

  • John Pedersen
Rewrite Rules And The Completion Procedure II
Part of the Lecture Notes in Computer Science book series (LNCS, volume 204)

References

  1. [1]
    Knuth, D. and Bendix, P. Simple word problems in universal algebras. In Computational Problems in Abstract Algebra. Leech, J. (Ed.), Pergamon Press, New York, 1970, pp.263–297.Google Scholar
  2. [2]
    Lankford, D.S. and Ballantyne, A.M. Decision procedures for simple equational theories with a permutative axiom: Complete sets of permutative reductions. In Proc. 3rd Automated Deduction Workshop, MIT, August 1977.Google Scholar
  3. [3]
    Pedersen, J. Algorithms for completing sets of identities, Master's thesis, Emory University, 1983.Google Scholar
  4. [4]
    Pedersen, J. Obtaining complete sets of reductions and equations without using special unification algorithms. (submitted to J. ACM.)Google Scholar
  5. [5]
    Peterson, G.E. and Stickel, M.E. Complete sets of reductions for some equational theories. J. ACM 28, 2 (1981), 233–264.CrossRefGoogle Scholar
  6. [6]
    Whitman, P. Free lattices. Ann. of Math. 42 (1941), 325–330.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • John Pedersen
    • 1
  1. 1.Department of MathematicsUCLALos AngelesUSA

Personalised recommendations