Challenge equality problems in lattice theory

  • William McCune
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 310)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Bumcroft65]
    Bumcroft, R., Proc. Glasgow Math. Assoc. 7, Pt. 1, pp.22–23 (1965).Google Scholar
  2. [Guard69]
    Guard, J., Oglesby, F., Bennett, J., and Settle, L., “Semi-automated mathematics”, Journal of the ACM 16, pp. 49–62 (1969).CrossRefGoogle Scholar
  3. [Hsiang87]
    Hsiang, J., and Rusinowitch, M., “On word problems in equational theories”, in Proceedings of the 14th International Colloquium on Languages, Automata, and Programming, Springer-Verlag Lecture Notes in Computer Science, Vol. 267, pp. 54–71 (1987).Google Scholar
  4. [McCharen76]
    McCharen, J., Overbeek, R., and Wos, L., “Complexity and related enhancements for automated theorem-proving programs”, Computers and Mathematics with Applications 2, pp. 1–16 (1976).CrossRefGoogle Scholar
  5. [Peterson83]
    Peterson, G. E., “A technique for establishing completeness results in theorem proving with equality”, SIAM Journal of Computing 12, pp. 82–100 (1983).CrossRefGoogle Scholar
  6. [Robinson69]
    Robinson, G., and Wos, L., “Paramodulation and theorem-proving in first-order theories with equality”, pp. 135–150 in Machine Intelligence 4, ed. B. Meltzer and D. Michie, Edinburgh University Press, Edinburgh (1969).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • William McCune
    • 1
  1. 1.Mathematics and Computer Science DivisionArgonne National LaboratoryArgonne

Personalised recommendations