On the use of subgoal clauses in bottom-up and top-down calculi

Fundamenta Informaticae

Volumn 39, Issue 1-2, 1999, Pages 123-143

  Fuchs, Dirk ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039778563     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-1999-391207     Document Type: Article

References (22)

1. 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. L. Bachmair and H. Ganzinger. Rewrite-based equational theorem proving with selection and simplification. Journal of Logic and Computation, 4(3):217-247, 1994.
3. M.P. Bonacina and J. Hsiang. The Clause-Diffusion methodology for distributed deduction. Fundamenta Informaticae, 24:177-207, 1995.
4. J. Denzinger. Knowledge-based distributed search using teamwork. Proceedings of ICMAS-95, pages 81-88. AAAI-Press, 1995.
5. J. Denzinger and D. Fuchs. Cooperation of Heterogeneous Provers. In Proceedings of IJCAI-99. Morgan Kaufmann, 1999, to appear.
6. J. Denzinger and M. Fuchs. Goal oriented equational theorem proving. In Proceedings of KI-94, pages 343-354. Springer, LNAI 861, 1994.
7. D. Fuchs. Cooperation of Top-Down and Bottom-Up Theorem Provers by Subgoal Clause Transfer. In Proceedings of AISC-98, pages 157-169. Springer, LNAI 1476, 1998.
8. D. Fuchs. Coupling saturation-based provers by exchanging positive/negative information. In Proceedings of RTA-98, pages 317-331. Springer, LNCS 1379, 1998.
9. D. Fuchs. Goal lift-up: A technique for combining connection-tableau-based proof procedures. Technical Report SR-98-06, University of Kaiserslautern, 1998.
10. M. Fuchs. Relevancy-Based Lemma Selection for Model Elimination using Lazy Tableaux Enumeration. In Proceedings of ECAI-98, pages 346-350. John Wiley & Sons, Ltd., 1998.
11. M. Fuchs. Lemma Generation for Model Elimination by Combining Top-Down and Bottom-Up Inference. In Proceedings of IJCAI-99. Morgan Kaufmann, 1999, to appear.
12. J. Harrison. Optimizing proof search in Model Elimination. In Proceedings of CADE-13, pages 313-327. Springer, LNAI 1104, 1996.
13. R. Hasegawa, K. Inoue, Y. Ohta, and M. Koshimura. Non-horn Magic Sets to Incorporate Top-down Inference into Bottom-up Theorem Proving. In Proceedings of CADE-14, pages 176-190. Springer, LNAI 1249, 1997.
14. Richard E. Korf. Depth-First Iterative-Deepening: An Optimal Admissible Tree Search. AI, 27:97-109, 1985. Elsevier Publishers B.V. (North-Holland).
15. R. Letz, K. Mayr, and C. Goller. Controlled Integration of the Cut Rule into Connection Tableau Calculi. JAR, 13:297-337, 1994.
16. S. Minton. Quantitative Results Concerning the Utility of Explanation-Based Learning. Artificial Intelligence, 42:363-391, 1990. Elsevier Science Publishers.
17. M. Moser, O. Ibens, R. Letz, J. Steinbach, C. Goller, J. Schumann, and K. Mayr. The Model Elimination Provers SETHEO and E-SETHEO. JAR, 18(2), 1997.
18. J. Schumann. Delta - a bottom-up preprocessor for top-down theorem provers. system abstract. In Proceedings of CADE-12, pages 774-777. Springer, LNAI 814, 1994.
19. M.E. Stickel. A prolog technology theorem prover: Implementation by an extended prolog compiler. JAR, 4:353-380, 1988.
20. M.E. Stickel. Upside-Down Meta-Interpretation of the Model Elimination Theorem-Proving Procedure for Deduction and Abduction. JAR, 13:189-210, 1994.
21. G. Sutcliffe, C.B. Suttner, and T. Yemenis. The TPTP Problem Library. In Proceedings of CADE-12, pages 252-266. LNAI 814, 1994.
22. C. Weidenbach, B. Gaede, and G. Rock. Spass & Flotter Version 0.42. In Proceedings of CADE-13, pages 141-145. LNAI 1104, 1996.