Cooperation between top-down and bottom-up theorem provers

Journal of Artificial Intelligence Research

Volumn 10, Issue , 1999, Pages 169-198

  Fuchs, Dirk ^a   Fuchs, Marc ^b  

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

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SIMULATION; MATHEMATICAL MODELS; PROBLEM SOLVING;

BOTTOM UP THEOREM PROVING; TOP DOWN THEOREM PROVING;

THEOREM PROVING;

EID: 0033330289     PISSN: 10769757     EISSN: None     Source Type: Journal    
DOI: 10.1613/jair.573     Document Type: Article

References (44)

1. Antoniou, G., & Langetepe, E. (1994). Applying SLD-resolution to a class of non-horn logic programs. Bulletin of the IGPL, 2(2), 231-243.
2. Astrachan, O., & Loveland, D. (1991). METEORS: High performance theorem provers using model elimination. In Automated Reasoning: Essays in Honor of Woody Bledsoe. Kluwer Academic Publishers.
3. Astrachan, O., & Loveland, D. (1997). The use of lemmas in the model elimination procedure. Journal of Automated Reasoning, 19(1), 117-141.
4. Astrachan, O., & Stickel, M. (1992). Caching and lemmaizing in model elimination theorem provers. In Proceedings of CADE-11, pp. 224-238. Springer, LNAI 607.
5. Bachmair, L., & Ganzinger, H. (1994). Rewrite-based equational theorem proving with selection and simplification. Journal of Logic and Computation, 4(3), 217-247.
6. Bancilhon, F., Maier, D., Sagiv, Y., & Ullmann, J. (1986). Magic sets and other strange ways to implement logic programs. In Proceedings of 5th ACM SIGMOD-SIGACT Symposium on Principles of Database Systems, pp. 1-15.
7. Bonacina, M. (1996). On the reconstruction of proofs in distributed theorem proving: a modified clause-diffusion method. Journal of Symbolic Computation, 21(4), 507-522.
8. Bonacina, M., & Hsiang, J. (1995). The clause-diffusion methodology for distributed deduction. Fundamenta Informaticae, 24, 177-207.
9. Conry, S. E., MacIntosh, D. J., & Meyer, R. A. (1990). DARES: A distributed automated reasoning system. In Proceedings of AAAI-90, pp. 78-85.
10. Denzinger, J. (1995). Knowledge-based distributed search using Teamwork. In Proceedings of ICMAS-95, pp. 81-88. AAAI-Press.
11. Denzinger, J., & Fuchs, D. (1998). Enhancing conventional search systems with multi-agent techniques: a case study. In Proceedings of ICMAS-98, pp. 419-420. IEEE Computer Society.
12. Denzinger, J., & Fuchs, M. (1994). Goal oriented equational theorem proving. In Proceedings of KI-94, pp. 343-354. Springer, LNAI 861.
13. Denzinger, J., Fuchs, M., & Fuchs, M. (1997). High performance ATP systems by combining several AI methods. In Proceedings of IJCAI '97, pp. 102-107.
14. Fitting, M. (1996). First-Order Logic and Automated Theorem Proving. Springer.
15. Fuchs, D. (1998a). Cooperation of top-down and bottom-up theorem provers by subgoal clause transfer. In Proceedings of AISC-98, pp. 157-169. Springer, LNAI 1476.
16. Fuchs, D. (1998b). Coupling saturation-based provers by exchanging positive/negative information. In Proceedings of RTA-98, pp. 317-331. Springer, LNCS 1379.
17. Fuchs, D. (1998c). Requirement-based cooperative theorem proving. In Proceedings of JELIA-98, pp. 139-153. Springer, LNAI 1489.
18. Fuchs, M. (1997). Flexible proof-replay with heuristics. In Proceedings of EPIA '97, pp. 1-12. Springer, LNAI 1323.
19. Fuchs, M. (1998a). Relevancy-based lemma selection for model elimination using lazy tableaux enumeration. In Proceedings of ECAI-98, pp. 346-350. John Wiley & Sons, Ltd.
20. Fuchs, M. (1998b). System abstract: Similarity-based lemma generation for model elimination. In Proceedings of CADE-15, pp. 33-37. Springer, LNAI 1421.
21. Fuchs, M. (1999). Lemma generation for model elimination by combining top-down and bottom-up inference. In Proceedings of IJCAI-99. Morgan Kaufmann, to appear.
22. Harrison, J. (1996). Optimizing proof search in model elimination. In Proceedings of CADE-13, pp. 313-327. Springer, LNAI 1104.
23. Hasegawa, R., Inoue, K., Ohta, Y., & Koshimura, M. (1997). Non-horn magic sets to incorporate top-down inference into bottom-up theorem proving. In Proceedings of CADE-14, pp. 176-190. Springer, LNAI 1249.
24. Iwanuma, K. (1997). Lemma matching for a PTTP-based top-down theorem prover. In Proceedings of CADE-14, pp. 146-160. Springer, LNAI 1249.
25. Korf, R. E. (1985). Depth-first iterative-deepening: An optimal admissible tree search. AI, 27, 97-109. Elsevier Publishers B.V. (North-Holland).
26. Letz, R., Mayr, K., & Goller, C. (1994). Controlled integration of the cut rule into connection tableau calculi. Journal of Automated Reasoning, 13, 297-337.
27. Letz, R., Schumann, J., Bayerl, S., & Bibel, W. (1992). SETHEO: A high-performance theorem prover. Journal of Automated Reasoning, 8(2), 183-212.
28. Loveland, D. (1968). Mechanical theorem-proving by model elimination. Journal of the ACM, 15(2).
29. Loveland, D. (1978). Automated Theorem Proving: a Logical Basis. North-Holland.
30. Loveland, D., Reed, D., & Wilson, D. (1995). SATCHMORE: SATCHMO with RElevancy. Journal of Automated Reasoning, 14, 325-351.
31. Markovitch, S., & Scott, P. (1993). Information filtering: Selection mechanisms in learning systems. Machine Learning, 10(2), 113-151.
32. Minton, S. (1990). Quantitative results concerning the utility of explanation-based learning. Artificial Intelligence, 42, 363-391. Elsevier Science Publishers.
33. Moser, M., Ibens, O., Letz, R., Steinbach, J., Goller, C., Schumann, J., & Mayr, K. (1997). The model elimination provers SETHEO and E-SETHEO. Journal of Automated Reasoning, 18(2).
34. Robinson, J. (1965). A machine oriented logic based on the resolution principle. Journal of the ACM, 12(1).
35. Schumann, J. (1994). Delta - a bottom-up preprocessor for top-down theorem provers. system abstract. In Proceedings of CADE-12, pp. 774-777. Springer, LNAI 814.
36. Stickel, M. (1988). A prolog technology theorem prover: Implementation by an extended prolog compiler. Journal of Automated Reasoning, 4, 353-380.
37. Stickel, M. (1994). Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction. Journal of Automated Reasoning, 13, 189-210.
38. Sutcliffe, G. (1992). A heterogeneous parallel deduction system. In Proceedings of FGCS'92 Workshop W3.
39. Sutcliffe, G., & Suttner, C. (1998). The TPTP problem library: CNF release v1.2.1. Journal of Automated Reasoning, 21, 177-203.
40. Sutcliffe, G., & Suttner, C. (1997). The results of the CADE-13 ATP system competition. Journal of Automated Reasoning, 18(2), 271-286.
41. Sutcliffe, G., Suttner, C., & Yemenis, T. (1994). The TPTP problem library. In Proceedings of CADE-12, pp. 252-266. LNAI 814.
42. Tammet, T. (1997). Gandalf. Journal of Automated Reasoning, 18(2), 199-204.
43. Weidenbach, C., Gaede, B., & Rock, G. (1996). Spass & Flotter Version 0.42. In Proc. CADE-13, pp. 141-145. Springer, LNAI 1104.
44. Wolf, A., & Fuchs, M. (1997). Cooperative parallel automated theorem proving. In Schnekenburger, T., & Stellner, G. (Eds.), Dynamic Load Distribution for Parallel Applications, pp. 129-145. Teubner.