Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
On the use of subgoal clauses in bottom-up and top-down calculi
Fundamenta Informaticae - Special issue on symbolic computation and artificial intelligence
OR-Parallel Theorem Proving with Random Competition
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
Coupling Saturation-Based Provers by Exchanging Positive/Negative Information
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
Goal Oriented Equational Theorem Proving Using Team Work
KI '94 Proceedings of the 18th Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
Cooperation Between Top-Down and Bottom-Up Theorem Provers by Subgoal Clause Transfer
AISC '98 Proceedings of the International Conference on Artificial Intelligence and Symbolic Computation
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
NORA/HAMMR: making deduction-based software component retrieval practical
ASE '97 Proceedings of the 12th international conference on Automated software engineering (formerly: KBSE)
High performance ATP systems by combining several AI methods
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Experiments with an Agent-Oriented Reasoning System
KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
Algorithms, Datastructures, and other Issues in Efficient Automated Deduction
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Partition-based logical reasoning for first-order and propositional theories
Artificial Intelligence - Special volume on reformulation
A cooperative multi-agent data mining model and its application to medical data on diabetes
AIS-ADM 2005 Proceedings of the 2005 international conference on Autonomous Intelligent Systems: agents and Data Mining
On the Use of Subgoal Clauses in Bottom-up and Top-down Calculi
Fundamenta Informaticae
| Hi-index | 0.00 |
We present a methodology for achieving co-operation between already existing theorem provers employing different proof paradigms and/or different search controls, and using different but related logics. Cooperation between the provers is achieved by periodically interchanging clauses which are selected by so-called referees. By employing referees both on the side of a sending prover and a receiving prover the communication is both success- and demand-driven, which results in a rather small communication overhead and synergetical effects. We report on experiments regarding the cooperation of the provers SPASS, SETHEO and DISCOUNT in domains of the TPTP library and with problems stemming from an application in software component retrieval. The experiments show significant improvements in the number of problems solved as well as in the solution times.