Abstract
The primary objective of this paper is to demonstrate the feasibility of using an automated theorem-proving program as an automated reasoning assistant. Such usage is not merely a matter of conjecture. As evidence, we cite a number of open questions which were solved with the aid of a theorem-proving program.
Although all of the examples are taken from studies employing the single program, AURA [19] (which was developed jointly at Argonne National Laboratory and Northern Illinois University), the nature of the various investigations shows that much of the success also could have been achieved with a number of theorem-proving programs. In view of this fact, one can now correctly state that the field of automated theorem proving has reached an important goal. A theorem-proving program can now be used as an aid to ongoing research in a number of unrelated fields.
The open questions are taken from studies of ternary boolean algebra, finite semigroups, equivalential calculus, and the design of digital circuits. Despite the variety of successes, no doubt there still exist many who are very skeptical of the value of automating any form of deep reasoning.
It is the nature of this skepticism which brings us to the second objective of the paper. The secondary objective is that of dispelling, at least in part, some of the resistance to such automation. To do this, we discuss two myths which form the basis for the inaccurate evaluation of both the usefulness and the potential of automated theorem proving. Rejection of the two myths removes an important obstacle to assigning to an automated theorem-proving program its proper roleāthe role of colleague and assistant.
This work was supported by the Applied Ma thematical Sciences Research Program (KC-04-02) of the Office of Energy Research of the U. S. Department of Energy under contract W-31-109-ENG-38.
Preview
Unable to display preview. Download preview PDF.
References
Allen, J. and Luckham, D., āAn interactive theorem-proving program,ā Machine Intelligence, Vol. 5(1970), Meltzer and Michie (eds), American Elsevier, New York, pp. 321ā336.
Fantauzzi, G., āAn algebraic model for the analysis of logic circuits,ā IEEE Transactions on Computers, Vol. C-23, No. 6, June 1974, pp. 576ā581.
Kalman, J., āA shortest single axiom for the classical equivalential calculus,ā Notre Dame Journal of Formal Logic, Vol. 19, No. 1, January 1978, pp. 141ā144.
Kalman, J., private communication.
Lukasiewicz, J., āDer Aquivalenzenkalkul,ā Collectanea Logica, Vol. 1 (1939), pp. 145ā169. English translation in [McCall], pp. 88ā115 and in [Lukasiewicz Borkowski], pp. 250ā277.
Lukasiewicz, J., Jan Lukasiewicz: Selected Works, ed. by L. Borkowski, North-Holland Publishing Co., Amsterdam (1970).
Lusk, E., āInput translator for the environmental theorem prover ā user's guide,ā to be published as an Argonne National Laboratory technical report.
McCall, S., Polish Logic, 1920ā1939, Clarendon Press, Oxford (1967).
McCharen, J., Overbeek, R. and Wos, L., āProblems and experiments for and with automated theorem proving programs,ā IEEE Transactions on Computers, Vol. C-25(1976), pp. 773ā782.
McCharen, J., Overbeek, R. and Wos, L., āComplexity and related enhancements for automated theorem-proving programs,ā Computers and Mathematics with Applications, Vol. 2(1976), pp. 1ā16.
Meridith, C., āSingle axioms for the systems (C,N), (C,0) and (A,N) of the two-valued propositional calculus,ā The Journal of Computing Systems, i, No. 3 (July 1953), pp. 155ā64.
Overbeek, R., āAn implementation of hyper-resolution,ā Computers and Mathematics with Applications, Vol. 1(1975), pp. 201ā214.
Peterson, J., āShortest single axioms for the equivalential calculus,ā Notre Dame Journal of Formal Logic, Vol. 17(1976), pp. 267ā271.
Peterson, J., āThe possible shortest single axioms for EC-tautologies,ā Auckland University Department of Mathematics Report Series No. 105, 1977.
Peterson, J., āAn automatic theorem prover for substitution and detachment systems,ā Notre Dame Journal of Formal Logic, Vol. XIX, Jan. 1978, pp 119ā122.
Peterson, J., āSingle axioms for the classical equivalential calculus,ā Auckland University Department of Mathematics Report Series No. 78.
Prior, A. N., Formal Logic, Second Edition, Oxford, 1962, Clarendon Press.
Robinson, J., āAutomatic deduction with hyper-resolution,ā International Journal of Computer Mathematics, Vol. 1(1965), pp. 227ā234.
Smith, B., āReference manual for the environmental theorem prover,ā to be published as an Argonne National Laboratory technical report.
Winker, S., Private Communication.
Winker, S. and Wos, L., āAutomated generation of models and counter examples and its application to open questions in ternary Boolean algebra,ā Proc. of the Eighth International Symposium on Multiple-valued Logic, Rosemont, Illinois, 1978, IEEE and ACM Publ., pp. 251ā256.
Winker, S., Wos, L. and Lusk, E., āSemigroups, antiautomorphisms, and involutions: a computer solution to an open problem, I,ā Mathematics of Computation, Vol. 37 (1981), pp. 533ā545.
Winker, S., āGeneration and verification of finite models and counterexamplesusing an automated theorem prover answering two open questions,ā to appear in J. ACM.
Wojciechowski, W. and Wojcik, A., āMultiple-valued logic design by theorem proving,ā Proc. of the Ninth International Symposium on Miltiple-valued Logic, Bath, England, 1979.
Wos, L., Robinson, G., Carson, D. and Shalla, L., āThe concept of demodulation in theorem proving,ā J. ACM, Vol. 14(1967), pp. 698ā704.
Wos, L., Winker, S., Veroff, R., Smith, B. and Henschen, L., āQuestions concerning possible shortest single axioms in equivalential calculus: an application of automated theorem proving to infinite domains,ā in preparation.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
Ā© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wos, L. (1982). Solving open questions with an automated theorem-proving program. In: Loveland, D.W. (eds) 6th Conference on Automated Deduction. CADE 1982. Lecture Notes in Computer Science, vol 138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0000049
Download citation
DOI: https://doi.org/10.1007/BFb0000049
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11558-8
Online ISBN: 978-3-540-39240-8
eBook Packages: Springer Book Archive