Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Controlling redundancy in large search spaces: Argonne-style theorem proving through the years

  • Session 5: Resolution Theorem Proving
  • Conference paper
  • First Online:
Logic Programming and Automated Reasoning (LPAR 1992)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 624))

Abstract

Argonne National Laboratory has been a center of research in automated theorem proving for nearly thirty years. In that time Argonne scientists and collaborators have developed a long series of theorem-proving systems with which to explore this fascinating field. Since the first systems of the mid-sixties, many features have changed of course, but others, perhaps the most fundamental, have remained the same. We survey here some of the history of those theorem-proving programs from the earliest to the most current, focusing in particular on the fundamental approach that has remained basically unchanged as a framework for the implementation of new ideas as they have come along. We will also try to identify the strengths and weaknesses of each of the systems by describing some of the problems that each could solve and could not solve, thus motivating the ideas for the next, system.

This work was supported by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy, under contract W-31-109-Eng-38.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Butler and R. Overbeek. A tutorial on the construction of high-performance resolution/paramodulation systems. Tech. Report ANL-90/30, Argonne National Laboratory, Argonne, IL, 1990.

    Google Scholar 

  2. T. Henry and W. McCune. FormEd: An X Window System application for managing first-order formulas. Tech. Memo ANL/MCS-TM-141, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, October 1990.

    Google Scholar 

  3. A. Jindal, R. Overbeek, and W. Cabot. Exploitation of parallel processing for implementing high-performance deduction systems. Journal of Automated Reasoning, 8(1):23–38, 1992.

    Article  Google Scholar 

  4. John Kalman. An itp workbook. Technical Report ANL-86-56, Argonne National Laboratory, December 1986.

    Google Scholar 

  5. D. Knuth and P. Bendix. Simple word problems in universal algebras. In J. Leech, editor, Computational Problems in Abstract Algebras. Pergamon Press, 1970.

    Google Scholar 

  6. E. Lusk and W. McCune. Experiments with Roo, a parallel automated deduction system. Preprint MCS-P254-0791, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, 1991. To appear in Springer-Verlag Lecture Notes in Artificial Intelligence.

    Google Scholar 

  7. E. Lusk, W. McCune, and R. Overbeek. Logic Machine Architecture: Inference mechanisms. In D. Loveland, editor, Proceedings of the 6th Conference on Automated Deduction, Lecture Notes in Computer Science, Vol. 138, pages 85–108, New York, 1982. Springer-Verlag.

    Google Scholar 

  8. E. Lusk, W. McCune, and R. Overbeek. Logic Machine Architecture: Kernel functions. In D. Loveland, editor, Proceedings of the 6th Conference on Automated Deduction, Lecture Notes in Computer Science, Vol. 138, pages 70–84, New York, 1982. Springer-Verlag.

    Google Scholar 

  9. E. Lusk, W. McCune, and J. Slaney. Roo—a parallel theorem prover. Tech. Memo MCS-TM-149, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, 1991.

    Google Scholar 

  10. E. Lusk and R. Overbeek. Experiments with resolution-based theorem-proving algorithms. Computers and Mathematics with Application, 8(3):141–152, 1982.

    Article  Google Scholar 

  11. E. Lusk and R. Overbeek. The automated reasoning system ITP. Tech. Report ANL-84/27, Argonne National Laboratory, Argonne, IL, April 1984.

    Google Scholar 

  12. E. Lusk and R. McFadden. Using automated reasoning tools: A study of the semigroup f2b2. Semigroup Forum, 36(1):75–88, 1987.

    Google Scholar 

  13. J. McCharen, R. Overbeek, and L. Wos. Problems and experiments for and with automated theorem-proving programs. IEEE Transactions on Computers, C-25(8):773–782, August 1976.

    Google Scholar 

  14. W. McCune. Otter 2.0 Users Guide. Tech. Report ANL-90/9, Argonne National Laboratory, Argonne, IL, March 1990.

    Google Scholar 

  15. W. McCune. Automated discovery of new axiomatizations of the left group and right group calculi. Preprint MCS-P220-0391, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, 1991. To appear in J. Automated Reasoning.

    Google Scholar 

  16. W. McCune. Experiments with discrimination tree indexing and path indexing for term retrieval. Preprint MCS-P191-1190, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, 1991. Invited paper, to appear in J. of Automated Reasoning.

    Google Scholar 

  17. W. McCune. Single axioms for the left group and right group calculi. Preprint MCS-P219-0391, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, 1991.

    Google Scholar 

  18. W. McCune. What's New in Otter 2.2. Tech. Memo ANL/MCS-TM-153, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, July 1991.

    Google Scholar 

  19. W. McCune and L. Wos. The absence and the presence of fixed point combinators. Theoretical Computer Science, 87:221–228, 1991.

    Google Scholar 

  20. R. Overbeek. A new class of automated theorem-proving algorithms. Journal of the ACM, 21:191–200, 1974.

    Google Scholar 

  21. R. Overbeek. An implementation of hyper-resolution. Computers and Mathematics with Applications, 1:201–214, 1975.

    Article  Google Scholar 

  22. G. Robinson and L. Wos. Paramodulation and theorem-proving in first-order theories with equality. In D. Michie and R. Meltzer, editors, Machine Intelligence, Vol. IV, pages 135–150. Edinburg U. Press, 1969.

    Google Scholar 

  23. J. Slaney. Finder, finite domain enumerator: Version 1.0 notes and guide. Tech. Report TR-ARP-10/91, Automated Reasoning Project, Australian National University, Canberra, Australia, 1991.

    Google Scholar 

  24. J. Slaney and E. Lusk. Parallelizing the closure computation in automated deduction. In M. Stickel, editor, Proceedings of the 10th International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence, Vol. 449, pages 28–39, New York, July 1990. Springer-Verlag.

    Google Scholar 

  25. S. Winker. Generation and verification of finite models and counterexamples using an automated theorem prover answering two open questions. J. ACM, 29:273–284, 1982.

    Article  Google Scholar 

  26. S. Winker, L. Wos, and E. Lusk. Semigroups, antiautomorphisms, and involutions: A computer solution to an open problem, I. Math. of Comp., 37:533–545, 1981.

    Google Scholar 

  27. L. Wos, D. Carson, and G. Robinson. The unit preference strategy in theorem proving. In Proceedings of the Fall Joint Computer Conferenc, pages 615–62, New York, 1964. Thompson Book Compan.

    Google Scholar 

  28. L. Wos, R. Overbeek, E. Lusk, and J. Boyle. Automated Reasoning: Introduction and Applications. McGraw-Hill, second edition, 1992.

    Google Scholar 

  29. L. Wos, G. Robinson, and D. Carson. Efficiency and completeness of the set of support strategy in theorem proving. J. ACM, 12(4):536–541, 1965.

    Article  Google Scholar 

  30. L. Wos, S. Winker, and E. Lusk. An automated reasoning system. In Proceedings of the AFIPS National Computer Conference, pages 697–702, 1981.

    Google Scholar 

  31. L. Wos, S. Winker, W. McCune, R. Overbeek, E. Lusk, R. Stevens, and R. Butler. Automated reasoning contributes to mathematics and logic. In M. Stickel, editor, Proceedings of the 10th International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence, Vol. 449, pages 485–499, New York, July 1990. Springer-Verlag.

    Google Scholar 

  32. L. Wos, S, Winker, B. Smith, R. Veroff, and L. Henschen. A new use of an automated reasoning assistant: Open questions in equivalential calculus and the study of infinite domains. Artificial Intelligence, 22:303–356, 1984.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematics and Computer Science Division, Argonne National Laboratory, 60439, Argonne, IL, USA

    Ewing L. Lusk

Authors
  1. Ewing L. Lusk
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lusk, E.L. (1992). Controlling redundancy in large search spaces: Argonne-style theorem proving through the years. In: Voronkov, A. (eds) Logic Programming and Automated Reasoning. LPAR 1992. Lecture Notes in Computer Science, vol 624. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013052

Download citation

  • DOI: https://doi.org/10.1007/BFb0013052

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55727-2

  • Online ISBN: 978-3-540-47279-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation