Cooperation of heterogeneous provers

IJCAI International Joint Conference on Artificial Intelligence

Volumn 1, Issue , 1999, Pages 10-15

  Denzinger, Jorg ^a   Fuchs, Dirk ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION OVERHEADS; DEMAND-DRIVEN; SEARCH CONTROL; SOFTWARE COMPONENT; THEOREM PROVERS; TPTP LIBRARY;

APPLICATION PROGRAMS; ARTIFICIAL INTELLIGENCE; COMMUNICATION; THEOREM PROVING;

EXPERIMENTS;

EID: 84880692234     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. L. Bachmair, N. Dershowitz, and D.A. Plaisted. Completion without Failure. In Coll on the Resolution of Equations in Algebraic Structures. Academic Press, Austin, 1989.
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. Parallelization of deduction strategies: an analytical study. Journal of Automated Reasoning 13:1-33, 1994.
4. J. Denzinger. Knowledge-Based Distributed Search Using Teamwork. In Proc. JCMAS-95, San Francisco, AAAI-Press, 1995, pp. 81-88.
5. J. Denzinger and M. Richs. Goal-oriented equational theorem proving using teamwork. In Proc. 18th Kl-94, Saarbriicken, LNAI 861, 1994, pp. 343-354.
6. J. Denzinger, Marc Fuchs, and Matthias Fuchs. High Performance ATP Systems by Combining Several AI Methods. In Proc. IJCAl-91, Nagoya, Morgan Kaufmann, 1997, pp. 102-107.
7. W. Ertel. OR-parallel theorem proving with random competition. In Proc. LPAR'92,St. Petersburg, LNAI 624, 1992, pp. 226-237.
8. D. Fuchs and J. Denzinger. Knowledge-based cooperation between theorem provers by TECHS. Technical Report SR-07-11, U. Kaiserslautern, 1997.
9. D. Fuchs. Cooperation between Top-Down and Bottom-Up Theorem Provers by Subgoal Clause Transfer. In Proc. AISC-98, Pittsburgh, NY, USA, LNAI 1476, 1998, pp. 157-169.
10. D. Fuchs. Coupling Saturation-Based Provers by Exchanging Positive/Negative Information. In Proc. RTA-98, Tsukuba, LNCS 1379, 1998, pp. 317-331.
11. D. Fuchs. On the Use of Subgoal Clauses in Bottom-up and Top-down Calculi. Fundamenta Informaticae, to appear, 1999.
12. T. Hogg and C.P. Williams. Solving the Really Hard Problems with Cooperative Search. In Proc. AAAI-93, Washington, AAAI-Press, 1993, pp. 231-236.
13. Richard E. Korf. Depth-First Iterative-Deepening: An Optimal Admissible Tree Search. A I, 27:97-109, 1985. Elsevier Publishers B.V. (North-Holland).
14. 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,
15. Schumann, J.; Fischer, B.: Making Deduction-Based Software Component Retrieval Practical. Proc. 12th Intl. Conf. Automated Software Engineering, Lake Tahoe, 1997, pp. 246-254.
16. G. Sutcliffe. A Heterogeneous Parallel Deduction System. In Proc. Workshop on Automated Deduction: Logic Programming and Parallel Computing Approaches, FGCS'92, Tokyo, 1992.
17. G, Sutcliffe, C.B. Suttner, and T. Yemenis. The TPTP Problem Library. In Proc. 12th CADE, Nancy, LNAI 814, 1994, pp. 252-266.
18. S.N, Talukdar, P.S. de Souza, and S, Murthy Organizations for Computer-based Agents. Journal of Engineering Intelligent Systems, 1993.