Abstract
Most general-purpose theorem-proving systems have weak search control. There is no alternative to the use of a large number of heuristics or strategies for search guidance. Choosing appropriate strategies for solving a given problem may require the knowledge of different strategies and may involve a lot of painstaking trial-and-error. To encourage the widespread use of computer reasoning systems, it is important that a theorem prover be usable by those with little knowledge of problem-solving strategies, and that a theorem prover be able to select good strategies for the user. An autonomous multistrategy theorem-proving system is developed, using knowledge-based techniques, to entirely free the user from the necessity of understanding the system or the merits of different strategies. All the user has to do is input his or her problem in first-order logic, and the system solves the problem efficiently for him or her without any manual intervention. The system embodies much of expert knowledge about how to solve problems. The knowledge is represented as metarules in knowledge base which guide a hyperlinking theorem prover to solve problems automatically and efficiently.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bundy, A., (1988). The Use of Explicit Proof Plans to Guide Inductive Proofs. InProc. 9th Int. Conf. Automated Deduction, pp. 111–120.
Bundy, A., Stevens, A., van Harmelen, P., Ireland, A., and Smaill, A. (1991). A Heuristic for Guiding Inductive Proofs. Technical Report No. 567, Department of Artificial Intelligence, Edinburgh. To appear inArtificial Intelligence.
Chang, C., and Lee, R., (1973).Symbolic Logic and Mechanical Theorem Proving. New York: Academic Press.
Chu, H., and Alexander, J. (1992). Personal communication.
Clocksin, W.F., and Mellish, C.S. (1987).Programming in Prolog. New York: Springer-Verlag.
Davis, M., and Putnam, H., (1960). A Computing Procedure for Quantification Theory.J. ACM, 7, 201–215.
de Kleer, J., (1986). An Assumption-Based TMS.Artif. Inteli, 28, 127–162.
Epp, S.S. (1990).Discrete Mathematics with Applications. Belmont, CA: Wadsworth.
Fleisig, S., Loveland, D., Smiley, A.K., and Yarmush, D.L. (1974). An Implementation of the Model Elimination Proof Procedure.J. ACM, 21, 124–139.
Galil, Z., (1977). On the Complexity of Regular Resolution and the Davis-Putnam Procedure.Theoret. Comput. Sci., 4, 23–46.
Gelernter, H., Hansen, J.R., and Loveland, D.W. (1963). Empirical Explorations of the Geometry Theorem Proving Machine. In E. Feigenbaum and J. Feldman (Eds.),Computers and Thought. New York: McGraw-Hill, pp. 153–167.
Genesereth, M., and Nilsson, N. (1987).Logical Foundations of Artificial Intelligence. Los Altos, CA: Morgan Kaufmann.
Good, D.I., London, R.L., and Bledsoe, W.W. (1975). An Interactive Program Verification System. InProc. Int. Conf. Reliable Software, Los Angeles.
Jackson, P. (1990).Introduction to Expert Systems. Workingham, England: Addison-Wesley.
Kowalski, R. (1979).Logic for Problem Solving. Amsterdam: North-Holland.
Larrabee, T. (1990).Efficient Generation of Test Patterns Using Boolean Satisfiability. Ph.D. thesis, Stanford University.
Lawrence, J.D., and Starkey, J.D. (1974). Experimental Tests of Resolution Based Theorem-Proving Strategies. Technical report, Department of Computer Science, Washington State University, Pullman, Washington.
Lee, S.-J., and Plaisted, D. (1991). Searching for Small Proofs in Automatic Theorem Proving. InProc. Nat. Computer. Symp. 1991, Taipei, Taiwan, pp. 626–632.
Lee, S.-J., and Plaisted, D. (1992). Eliminating Duplication with the Hyper-Linking Strategy. J.Automat. Reasoning, 9, 25–42.
Lee, S.-J., and Plaisted D. (1992). Use of Unit Clauses and Clause Splitting in Automatic Deduction. InProc. 4th Int. Conf. Computing and Information, Toronto, Canada, pp. 228–232.
Lee, S.-J., and Plaisted, D., Use of Replace Rules in Theorem Proving.Meth. Logic Comput. Sci. (to appear).
Loveland, D., (1978).Automated Theorem Proving: A Logical Basis. New York: North-Holland.
Lusk, E., and Overbeek, R. (1985). Non-horn Problems.J. Automat. Reasoning, 1, 103–114.
McAllester, D. (1980). An Outlook on Truth Maintenance. Technical Report AIM-551, Artificial Intelligence Laboratory, MIT, Cambridge, MA.
McCune, W.W. (1989).Otter 1.0 Users' Guide. Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, Ill.
Michie, D., Ross, R., and Shannan, G.J. (1972). G-Deduction.Mach. Intell, 7, 141–165.
Negrete, S. (1991). Proof Plans with Hints. Master's thesis, University of Edinburgh.
Nie, X. (1989).Implementation Techniques in Automatic Theorem Proving. Ph.D. thesis, University of North Carolina at Chapel Hill.
Nie, X., and Plaisted, D. (1990). A Complete Semantic Back Chaining Proof System. In Proc.10th Int. Conf. Automated Deduction.
Pereira, F. (1984)C-Prolog User's Manual. SRI International, Menlo Park, Cal.
Plaisted, D. (1988). Non-Horn Clause Logic Programming without Contrapositives.J. Automat. Reasoning, 4, 287–325.
Plaisted, D. (1990). Mechanical Theorem Proving. In R. Banerji (Ed.)A Sourcebook on Formal Techniques in Artificial Intelligence. Amsterdam: Elsevier.
Plaisted, D., and Lee, S.-J. (1990). Inference by Clause Matching. In Z. Ras and M. Zemankova (Ed.)Intelligent Systems: State of the Art and Future Directions. New York: Ellis Horwood, pp. 200–235.
Robinson, J. (1963). Theorem Proving on the Computer.J. ACM, 10, 163–174.
Stevens, A. (1988). A Rational Reconstruction of Boyer and Moore's Technique for Constructing Induction Formulas. InProc. Europ. Conf. Artif. Intell. pp. 565–570.
Stickel, M.E. (1988). A Prolog Technology Theorem Prover: Implementation by an Extended Prolog Compiler.J. Automat. Reasoning, 4, 353–380.
Tseitin, G.S. (1968). On the Complexity of Derivations in the Propositional Calculus. In A.O. Slisenko, (Ed.)Structures in Constructive Mathematics and Mathematical Logic, Part II, pp. 115–125.
Vlach, F. (1990). A Tautology Checker for VLSI Applications That Uses Rule-Based Simplification and Directed Backtracking. Technical Report N-90-010, Department of Computer Sciences, University of Texas at Denton.
Wang, T.C., and Bledsoe, W.W. (1987). Hierarchical Deduction.J. Automat. Reasoning, 3, 35–77.
Wos, L. Unpublished notes.
Wos, L. (1988).Automated Reasoning: 33 Basic Research Problems. Englewood Cliffs, NJ: Prentice Hall.
Wos, L., Overbeek, R., Lusk, E., and Boyle, J. (1984).Automated Reasoning: Introduction and Applications. Englewood Cliffs, NJ: Prentice Hall.
Wos, L. Robinson, G., and Carson, D. (1965). Efficiency and Completeness of the Set of Support Strategy in Theorem Proving.J. ACM, 12, 536–541.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lee, SJ. An autonomous multistrategy theorem proving system using knowledge-based techniques. J Intell Inf Syst 3, 89–117 (1994). https://doi.org/10.1007/BF01014021
Issue Date:
DOI: https://doi.org/10.1007/BF01014021