Combining Parallel and Distributed Search in Automated Equational Deduction

Authors:
Carsten Sinz;Jörg Denzinger;Jürgen Avenhaus;Wolfgang Küchlin
Affiliations:
-;-;-;-
Venue:
PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
Year:
2001

Citing 6
Cited 0

Rewrite systems

Handbook of theoretical computer science (vol. B)
DISCOUNT - A Distributed and Learning Equational Prover

Journal of Automated Reasoning
The TPTP Problem Library

Journal of Automated Reasoning
Heuristical Criteria in Refutational Theorem Proving

DISCO '90 Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems
Parallel ReDuX - PaReDuX

RTA '95 Proceedings of the 6th 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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an automated deduction system for equational reasoning combining two different parallelization/distribution schemes: Strategy-compliant parallelization on the level of individual deduction steps (PaReDuX) and distributed cooperation of multiple agents with different search strategies (Teamwork). In our experiments we mainly observeda multiplication of the speed-ups of each approach in our combined system.