Cooperation between top-Down and bottom-Up theorem provers by subgoal clause transfer

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

Volumn 1476, Issue , 1998, Pages 157-169

  Fuchs, Dirk ^a  

^a Rheinland Pfälzische Technische Universität Kaiserslautern Landau   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BIOMINERALIZATION;

BOTTOM UP; GOAL ORIENTATIONS; GOAL-ORIENTED; HIGH POTENTIAL; PROOF-LENGTH; REDUNDANCY CONTROL; SUBGOALS; THEOREM PROVERS;

THEOREM PROVING;

EID: 84961342653     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055910     Document Type: Conference Paper

References (16)

1. [AL97] O.L. Astrachan and D.W. Loveland. The use of Lemmas in the Model Elimination Procedure. Journal of Automated Reasoning, 19(1):117-141, 1997.
2. [AS92] O.L. Astrachan and M.E. Stickel. Caching and Lemmaizing in Model Elimination Theorem Provers. In Proceedings of CADE-11, pages 224-238, Saratoga Springs, USA, 1992. Springer LNAI 607.
3. [BG94] L. Bachmair and H. Ganzinger. Rewrite-based equational theorem proving with selection and simplification. Journal of Logic and Computation, 4(3):217-247, 1994.
4. [DF94] J. Denzinger and M. Fuchs. Goal oriented equational theorem proving. In Proc. 18th KI-94, pages 343-354, Saarbriicken, 1994. LNAI 861.
5. [DF98] J. Denzinger and D. Fuchs. Enhancing conventional search systems with multiagent techniques: a case study. In Proc. Int. Conf. on Multi Agent Systems (ICMAS) 98, Paris, France, 1998.
6. [Fuc98a] D. Fuchs. Cooperation between Top-Down and Bottom-Up Theorem Provers by Subgoal Clause Transfer. Technical Report SR-98-01, University of Kaiserslautern, Kaiserslautern, 1998.
7. [Fuc98b] M. Fuchs. Similarity-Based Lemma Generation for Model Elimination. In Proc. CADE-15, Lindau, Germany, 1998.
8. [Kor85] Richard E. Korf. Depth-First Iterative-Deepening: An Optimal Admissible Tree Search. AI, 27:97 — 109, 1985. Elsevier Publishers B.V. (North-Holland).
9. [LMG94] R. Letz, K. Mayr, and C. Goller. Controlled Integration of the Cut Rule into Connection Tableau Calculi. Journal of Automated Reasoning, (13):297-337, 1994.
10. [Lov68] D.W. Loveland. Mechanical Theorem-Proving by Model Elimination. Journal of the ACM, 15(2), 1968.
11. [MIL+97] M. Moser, O. Ibens, R. Letz, J. Steinbach, C. Goller, J. Schumann, and K. Mayr. The Model Elimination Provers SETHEO and E-SETHEO. The Journal of Automated Reasoning, 1997.
12. [Sch94] J. Schumann. Delta - a bottom-up preprocessor for top-down theorem provers. system abstract. In Proceedings of CADE-12. Springer, 1994.
13. [SSY94] G. Sutcliffe, C.B. Suttner, and T. Yemenis. The TPTP Problem Library. In CADE-12, pages 252-266, Nancy, 1994. LNAI 814.
14. [Sti88] M.E. Stickel. A prolog technology theorem prover: Implementation by an extended prolog compiler. Journal of Automated Reasoning, 4:353-380, 1988.
15. [Sut92] G. Sutcliffe. A heterogeneous parallel deduction system. In Proc. FGCS'92 Workshop W3, 1992.
16. [WGR96] C. Weidenbach, B. Gaede, and G. Rock. Spass & Flotter Version 0.42. In Proc. CADE-13, pages 141-145, New Brunswick, 1996. LNAI 1104.