Skip to main content
SpringerLink
Log in

The Watson Theorem Prover

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

Watson is a general-purpose system for formal reasoning. It is an interactive equational higher-order theorem prover. The higher-order logic supported by the prover is distinctive in being type free (it is a safe variant of Quine's NF). Watson allows the development of automated proof strategies, which are represented and stored by the prover in the same way as theorems. The mathematical foundations of the prover and the way these are presented to a user are discussed. The paper also contains discussions of experiences with the prover and relations of the prover to other systems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Brackin, S.,Meadows, C. andMillen, J.: CAPSL interface for the NRL protocol analyzer, IEEE Symposium on Application-Specific Systems and Software Engineering Technology (ASSET '99), Dallas, March 1999.

  2. Boyer, B., Kaufmann, M. and Moore, J S.: The Boyer-Moore theorem prover and its interactive enhancement, Comput. Math. Appl. 29(2) (1995), 27–62.

    Google Scholar 

  3. Camilleri, A., Gordon, M. and Melham, T.: Hardware verification using higher-order logic, in D. Borrione (ed.), HDL Descriptions to Guaranteed Correct Circuit Designs, Elsevier Scientific Publishers, 1987.

  4. Char, B. et al.: The Maple symbolic computation system, SIGSAM Bull. 17(3/4) (1983), 31–42.

    Google Scholar 

  5. Church, A.: A formulation of the simple theory of types, J. Symbolic Logic 5 (1940).

  6. Cohen, E.: Programming in the 90's: An Introduction to the Calculation of Programs, Springer-Verlag, 1990.

  7. Constable, R. L. et al.: Implementing Mathematics with the Nuprl Proof Development System, Prentice-Hall, 1986.

  8. de Bruijn, N.: Lambda-calculus with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem, in R. P. Nederpelt et al. (eds), Selected Papers on Automath, North-Holland, 1994.

  9. Farmer, W. M., Guttman, J. D. and Thayer, F. J.: IMPS: An Interactive Mathematical Proof System (system abstract), in 10th Internat. Conf. Automated Deduction, 1990, pp. 653–654.

  10. Gordon, M.: A proof generating system for higher-order logic, Technical Report 103, University of Cambridge Computer Laboratory, January 1987.

  11. Gordon, M. and Melham, T. F.: Introduction to HOL: A Theorem Proving Environment for Higher Order Logic, Cambridge, 1993.

  12. Gordon, M. J. C., Milner, R. and Wadsworth, C. P.: Edinburgh LCF: A Mechanised Logic of Computation, Lecture Notes in Comput. Sci. 78, Springer-Verlag, 1979.

  13. Gries, D. and Schneider, F. B.: A Logical Approach to Discrete Math, Springer-Verlag, 1993.

  14. Randall Holmes, M.: Elementary Set Theory with a Universal Set, Academia-Bruylant, Louvain-la-Neuve, 1998.

    Google Scholar 

  15. Randall Holmes,M.: A functional formulation of first-order logic “with infinity” without bound variables, Preprint, available from the author.

  16. Randall Holmes,M.: TheMark2 theorem prover, final progress report of Army Research Office grant DAAH04–94–0247.

  17. Randall Holmes, M.: Systems of combinatory logic related to Quine's “New Foundations”, Ann. Pure Appl. Logic 53 (1991), 103–133.

    Google Scholar 

  18. Randall Holmes, M.: Untyped-calculus with relative typing, in Typed Lambda-Calculi and Applications (Proceedings of TLCA '95), Springer, 1995, pp. 235–248.

  19. Thomas, J.: OTTER experiments in a system of combinatory logic, J. Automated Reasoning 14(3) (1994), 413–426.

    Google Scholar 

  20. Jensen, R. B.: On the consistency of a slight (?) modification of Quine's “New Foundations”, Synthese 19 (1969), 250–263.

    Google Scholar 

  21. Kapur, D. and Zhang, H.: An overview of RRL (Rewrite Rule Laboratory), Proceedings of the Third International Conf. of Rewriting Techniques and Applications, Chapel Hill, North Carolina, April 1989.

    Google Scholar 

  22. Knuth, D. and Bendix, P.: Simple word problems in universal algebras, in J. Leech (ed.), Computational Problems in Abstract Algebra, Pergamon Press, 1970, pp. 263–297.

  23. McCune, W.: Otter 3.0 reference manual and guide, Technical Report ANl-94/6, Argonne National Laboratory, 1994.

  24. Milner, et al.: The Definition of Standard ML (Revised), MIT Press, 1997.

  25. Nederpelt, R. P. et al. (eds), Selected Papers on Automath, North-Holland, 1994.

  26. Quine, W. V. O.: New foundations for mathematical logic, Amer. Math. Monthly 44 (1937), 70–80.

    Google Scholar 

  27. Syverson, P. F. and van Oorschot, P. C.: On unifying some cryptographic protocol logics, Proceedings of the 1994 IEEE Computer Society Symposium on Research in Security and Privacy, Oakland, CA, May 1994, IEEE CS Press, Los Alamitos, 1994.

    Google Scholar 

  28. Wolfram, S.: Mathematica: A System for Doing Mathematics by Computer, Addison-Wesley, 1988.

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, Boise State University, Boise, ID, 83725, U.S.A.

    M. Randall Holmes

  2. Center for Secure and Dependable Software, University of Idaho, USA

    Jim Alves-Foss

Authors
  1. M. Randall Holmes
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jim Alves-Foss
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Holmes, M.R., Alves-Foss, J. The Watson Theorem Prover. Journal of Automated Reasoning 26, 357–408 (2001). https://doi.org/10.1023/A:1010652212067

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1010652212067

Search

Navigation