E-SETHEO: Design, configuration and Use of a parallel automated theorem prover

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1747, Issue , 1999, Pages 231-243

  Stenz, Gemot ^a   Wolf, Andreas ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; GENETIC ALGORITHMS;

AUTOMATED THEOREM PROVER; AUTOMATED THEOREM PROVING; AUTOMATIC SYSTEMS; DISTRIBUTED RESOURCES; GRADIENT PROCEDURE; PARALLEL STRATEGIES; RESOURCE CONFIGURATIONS; STRATEGY-SELECTION PROBLEM;

THEOREM PROVING;

EID: 84886071628     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46695-9_20     Document Type: Conference Paper

References (24)

1. D. J. Cook and R. C. Varnell. Adaptive Parallel Iterative Deepening Search. JAIR, 9:139-165, 1998.
2. J. Denzinger, Knowledge-Based Distributed Search Using Teamwork. ICMAS-95, pp. 81-88. 1995.
3. J. Denzinger and M. Puchs. Experiments in Learning Prototypical Situations for Variants of the Pursuit Game. ICMAS-96, pp. 48-55. 1996.
4. B. I. Dahn, J. Gehne, T. Honigmann, and A. Wolf. Integration of Automated and Interactive Theorem Proving in ILF. CADE-U, LNAI 1249, pp. 57-60. 1997.
5. J. Denzinger, M. Kronenburg, and S. Schulz. DISCOUNT. A Distributed and Learning Equational Prover. JAR, 18(2):189-198, 1997.
6. B. Fischer, J. Schumann, and G. Snelting. Deduction Based Software Retrieval. Automated Deduction. A Basis for Applications. Volume 3, pp. 265-292. Kluwer, 1998.
7. J. H. Holland. Adaptation in Natural and Artificial Systems. MIT Press, 1992.
8. R. E. Korf. Depth-First Iterative-Deepening: An Optimal Admissible Tree Search. Expert Systems, A Software Methodology for Modem Applications, pp. 380-389. IEEE Computer Society Press, 1990.
9. J. R. Koza. Genetic Programming. MIT Press, 1992.
10. R. Letz, K. Mayr, and C. Goller. Controlled Integration of the Cut Rule into Connection Tableau Calculi. JAR, 13(3):297-338, 1994.
11. D. W. Loveland. Automated Theorem Proving: a Logical Basis. North-Holland, 1978.
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.
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.
14. S. Schulz. System Abstract: E 0.3. CADE-16, LNAI 1632, pp. 297-60. 1999.
15. J. Schumann and R. Letz. PARTHEO: A High-Performance Parallel Theorem Prover. CADE-10, LNAI 449, pp. 40-56. 1990.
16. G. Stenz and A. Wolf. Strategy Selection by Genetic Programming. FLAIRS-12, pp. 346-350. 1999.
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.
18. C. Suttner and J. Schumann. Parallel Automated Theorem Proving. PPAI-94, pp. 209-257. 1994.
19. G. SutclifFe and D. Seyfang. Smart Selective Competition Parallelism ATP. FLAIRS-99, pp. 341-345. 1999.
20. G. Sutcliffe, C. Suttner, and T. Yemenis. The TPTP Problem Library. CADE-12, LNAI 814, pp. 252-266. 1994.
21. C. Weidenbach, B. Gaede and G. Rock. SPASS & PLOTTER version 0.42. CADE-13, LNAI 1104, pp. 141-145. 1996.
22. A. Wolf Eind R. Letz. Strategy Parallelism in Automated Theorem Proving. IJPRAI, 13(2):219-245, 1999.
23. A. Wolf. p-SETHEO: Strategy Parallelism in Automated Theorem Proving. TABLEAUX-98, LNAI 1397, pp. 320-324. 1998.
24. A. Wolf. Strategy Selection for Automated Theorem Proving. AIMSA-98, LNAI 1480, pp. 452-465. 1998.