Skip to main content

E-SETHEO: Design, Configuration and Use of a Parallel Automated Theorem Prover

  • Conference paper
Advanced Topics in Artificial Intelligence (AI 1999)

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

Included in the following conference series:

Abstract

One of the key issues in Automated Theorem Proving is the search for optimal proof strategies. Since there is not one uniform strategy which works optimally on all proof tasks, one is faced with the difficult problem of selecting a good strategy for a given task. Strategy parallelism, where a proof task is attempted in parallel by a set of strategies with distributed resources, is a way of circumventing this strategy selection problem. However, the problem of selecting the parallel strategies and distributing the available resources among them still remains. Therefore we have developed a method for automatic strategy and resource configuration based on the combination of a genetic algorithm and a gradient procedure. For the effective use of this method it is necessary to be able to automatically gather large amounts of experimental data. We present an environment for such large scale data collection that has been used by us in preparation of the CADE-16 automatic system competition. In order to evaluate the potential of the method experimentally, we have implemented the strategy parallel theorem prover e-SETHEO. The experimental results obtained with the system already justify our approach while showing substantial potential for future development.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. J. Cook and R. C. Varnell. Adaptive Parallel Iterative Deepening Search. JAIR, 9:139–165, 1998.

    MATH  Google Scholar 

  2. J. Denzinger. Knowledge-Based Distributed Search Using Teamwork. ICMAS-95, pp. 81–88. 1995.

    Google Scholar 

  3. J. Denzinger and M. Fuchs. Experiments in Learning Prototypical Situations for Variants of the Pursuit Game. ICMAS-96, pp. 48–55. 1996.

    Google Scholar 

  4. B. I. Dahn, J. Gehne, T. Honigmann, and A. Wolf. Integration of Automated and Interactive Theorem Proving in ILF. CADE-14, LNAI 1249, pp. 57–60. 1997.

    Google Scholar 

  5. J. Denzinger, M. Kronenburg, and S. Schulz. DISCOUNT. A Distributed and Learning Equational Prover. JAR, 18(2):189–198, 1997.

    Article  Google Scholar 

  6. B. Fischer, J. Schumann, and G. Snelting. Deduction Based Software Retrieval. Automated Deduction. A Basis for Applications. Volume III, pp. 265–292. Kluwer, 1998.

    Google Scholar 

  7. J. H. Holland. Adaptation in Natural and Artificial Systems. MIT Press, 1992.

    Google Scholar 

  8. R. E. Korf. Depth-First Iterative-Deepening: An Optimal Admissible Tree Search. Expert Systems, A Software Methodology for Modern Applications, pp. 380–389. IEEE Computer Society Press, 1990.

    Google Scholar 

  9. J. R. Koza. Genetic Programming. MIT Press, 1992.

    Google Scholar 

  10. R. Letz, K. Mayr, and C. Goller. Controlled Integration of the Cut Rule into Connection Tableau Calculi. JAR, 13(3):297–338, 1994.

    Article  MATH  Google Scholar 

  11. D. W. Loveland. Automated Theorem Proving: a Logical Basis. North-Holland, 1978.

    Google Scholar 

  12. M. Moser, O. Ibens, R. Letz, J. Steinbach, C. Goller, J. Schumann, and K. Mayr. SETHEO and E-SETHEO. The CADE-13 Systems. JAR, 18(2):237–246, 1997.

    Article  Google Scholar 

  13. J. Schumann. Using SETHEO for Verifying the Development of a Communication Protocol in Focus — A Case Study. TABLEAUX-95, LNAI 918, pp. 338–352. 1995.

    Google Scholar 

  14. S. Schulz. System Abstract: E 0.3. CADE-16, LNAI 1632, pp. 297–60. 1999.

    Google Scholar 

  15. J. Schumann and R. Letz. PARTHEO: A High-Performance Parallel Theorem Prover. CADE-10, LNAI 449, pp. 40–56. 1990.

    Google Scholar 

  16. G. Stenz and A. Wolf. Strategy Selection by Genetic Programming. FLAIRS-12, pp. 346–350. 1999.

    Google Scholar 

  17. D. B. Sturgill and A. M. Segre. A Novel Asynchronous Parallelism Scheme for First-Order Logic. CADE-12, LNAI 814, pp. 484–498. 1994.

    Google Scholar 

  18. C. Suttner and J. Schumann. Parallel Automated Theorem Proving. PPAI-94, pp. 209–257. 1994.

    Google Scholar 

  19. G. Sutcliffe and D. Seyfang. Smart Selective Competition Parallelism ATP. FLAIRS-99, pp. 341–345. 1999.

    Google Scholar 

  20. G. Sutcliffe, C. Suttner, and T. Yemenis. The TPTP Problem Library. CADE-12, LNAI 814, pp. 252–266. 1994.

    Google Scholar 

  21. C. Weidenbach, B. Gaede and G. Rock. SPASS & FLOTTER version 0.42. CADE-13, LNAI 1104, pp. 141–145. 1996.

    Google Scholar 

  22. A. Wolf and R. Letz. Strategy Parallelism in Automated Theorem Proving. IJPRAI, 13(2):219–245, 1999.

    Google Scholar 

  23. A. Wolf. p-SETHEO: Strategy Parallelism in Automated Theorem Proving. TABLEAUX-98, LNAI 1397, pp. 320–324. 1998.

    Google Scholar 

  24. A. Wolf. Strategy Selection for Automated Theorem Proving. AIMSA-98, LNAI 1480, pp. 452–465. 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Stenz, G., Wolf, A. (1999). E-SETHEO: Design, Configuration and Use of a Parallel Automated Theorem Prover. In: Foo, N. (eds) Advanced Topics in Artificial Intelligence. AI 1999. Lecture Notes in Computer Science(), vol 1747. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46695-9_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-46695-9_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66822-0

  • Online ISBN: 978-3-540-46695-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics