References
Chang, C. and Lee, R., Symbolic Logic and Mechanical Theorem Proving (Academic Press, New York, 1973).
Lusk, E. and Overbeek. R., A portable environment for research in automated reasoning, Proceedings of the 7th Conference in Automated Deduction, R. Shostak, ed., Lecture Notes in Computer Science 170, G. Goos and J. Hartmanis, eds. (Springer-Verlag, New York, 1984), pp. 43–52.
Plaisted, D., Theorem proving with abstraction, Artificial Intelligence 16 (1981) 47–108.
Plaisted, D., A simplified problem reduction format, Artificial Intelligence 18 (1982) 227–261.
Plaisted, D., and Greenbaum, S., A structure-preserving clause form translation, Journal of Symbolic Computation, 1986, to appear.
Reboh, R, Raphael, B., Yates, R., Kling, R., and Velarde, C., Study of automatic theorem-proving programs, Technical note 75, Artificial Intelligence Center, SRI International, Menlo Park, California, 1972.
Robinson, J., Theorem proving on the computer, J. ACM 10 (1963) 163–174.
Walther, C., Schubert's Steamroller — a case study in many sorted resolution, technical report, Institut for Informatik, May, 1984.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Greenbaum, S., Plaisted, D.A. (1986). The illinois prover: A general purpose resolution theorem prover. In: Siekmann, J.H. (eds) 8th International Conference on Automated Deduction. CADE 1986. Lecture Notes in Computer Science, vol 230. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16780-3_137
Download citation
DOI: https://doi.org/10.1007/3-540-16780-3_137
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16780-8
Online ISBN: 978-3-540-39861-5
eBook Packages: Springer Book Archive