Preview
Unable to display preview. Download preview PDF.
References
Bumcroft, R., Proc. Glasgow Math. Assoc. 7, Pt. 1, pp.22–23 (1965).
Guard, J., Oglesby, F., Bennett, J., and Settle, L., “Semi-automated mathematics”, Journal of the ACM 16, pp. 49–62 (1969).
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).
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).
Peterson, G. E., “A technique for establishing completeness results in theorem proving with equality”, SIAM Journal of Computing 12, pp. 82–100 (1983).
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).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
McCune, W. (1988). Challenge equality problems in lattice theory. In: Lusk, E., Overbeek, R. (eds) 9th International Conference on Automated Deduction. CADE 1988. Lecture Notes in Computer Science, vol 310. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0012868
Download citation
DOI: https://doi.org/10.1007/BFb0012868
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19343-2
Online ISBN: 978-3-540-39216-3
eBook Packages: Springer Book Archive