论文信息 - Combining Parallel and Distributed Search in Automated Equational Deduction

Combining Parallel and Distributed Search in Automated Equational Deduction

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.

[1] J. Urgen Lind,et al. Twlib { a Library for Distributed Search Applications , 1996 .

[2] Gérard P. Huet,et al. A Complete Proof of Correctness of the Knuth-Bendix Completion Algorithm , 1981, J. Comput. Syst. Sci..

[3] Matthias Fuchs,et al. Goal Oriented Equational Theorem Proving Using Team Work , 1994, KI.

[4] Nirina Andrianarivelo,et al. Heuristical Criteria in Refutational Theorem Proving , 1990, DISCO.

[5] Wolfgang Küchlin,et al. Parallel ReDuX -> PaReDuX , 1995, RTA.

[6] Donald E. Knuth,et al. Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research. , 1970 .

[7] Weber,et al. Parallel Term Rewriting with Paredux , 1998 .

[8] Jean-Pierre Jouannaud,et al. Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[9] A. Tarski,et al. A Formalization Of Set Theory Without Variables , 1987 .

[10] Wolfgang Küchlin,et al. Experiments with Virtual C Threads , 1992, [1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing.

[11] Matthias Fuchs,et al. A Comparison of Equality Reasoning Heuristics , 1998 .