Abstract
SPTHEO is a parallelization of the sequential theorem proving system SETHEO, based on the SPS model for parallel search. The SPS model has been designed to allow efficient parallel search even in comparatively low bandwidth and high latency environments, such as workstation networks. In order to obtain a portable and efficient implementation, the PVM message passing system has been used for implementing the communication part of the system. This report describes the basic outline of the system, and presents evaluation results for the communication aspects as well as the performance as a proof system.
This research has been funded by the DFG SFB 342 subproject A5 (Parallelization in Inference Systems).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
W. Ertel. Parallele Suche mit randomisiertem Wettbewerb in Inferenzsystemen, volume 25 of DISKI. Infix-Verlag, 1993.
C. Goller, R. Letz, K. Mayr, and J. Schumann. SETHEO V3.2: Recent Developments (System Abstract). In Proceedings of CADE-12, pages 778–782. Springer LNAI 814, 1994.
M. Huber. Parallele Simulation des Theorembeweiser SETHEO unter Verwendung des Static Partitioning Konzepts. Diplomarbeit, Institut für Informatik, TU München, 1993.
R. Letz, K. Mayr, and C. Goller. Controlled Integrations of the Cut Rule into Connection Tableau Calculi. J. of Autom. Reas., 13(3):297–337, 1994.
R. Letz, J. Schumann, S. Bayerl, and W. Bibel. SETHEO: A High-Performance Theorem Prover. J. of Autom. Reasoning, 8(2):183–212, 1992.
J. Schumann. Efficient Theorem Provers based on an Abstract Machine. Dissertation, Institut für Informatik, TU München, Germany, 1991.
J. Schumann. Using SETHEO for Verifying the Development of a Communication Protocol in FOCUS — A Case Study. In Proc. of Workshop Analytic Tableaux and Related Methods, pages 338–352. Springer LNAI 918, 1995.
C.B. Suttner and J. Schumann. Parallel Automated Theorem Proving. In Parallel Processing for Artificial Intelligence 1, Machine Intelligence and Pattern Recognition 14, pages 209–257. Elsevier, 1994.
C.B. Suttner and G. Sutcliffe. The TPTP Problem Library (TPTP v1.2.0 — TR Date 19.5.95), 1995. Technical Report AR-95-03, Institut für Informatik, TU München, Germany. Accessible via http://wwwjessen.informatik.tu-muenchen. de/∼suttner/TPTP.html
G. Sutcliffe, C.B. Suttner, and T. Yemenis. The TPTP Problem Library. In Proceedings of CADE-12, pages 252–266. Springer LNAI 814, 1994.
C.B. Suttner. Parallelization of Search-based Systems by Static Partitioning with Slackness, 1995. Dissertation, Institut für Informatik, TU München. Published by Infix-Verlag, volume DISKI 101, Germany.
C.B. Suttner. Static Partitioning with Slackness. In Parallel Processing for Artificial Intelligence 3. Elsevier, 1996. to appear.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Suttner, C.B. (1996). SPTHEO — A PVM-based parallel theorem prover. In: Bode, A., Dongarra, J., Ludwig, T., Sunderam, V. (eds) Parallel Virtual Machine — EuroPVM '96. EuroPVM 1996. Lecture Notes in Computer Science, vol 1156. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3540617795_15
Download citation
DOI: https://doi.org/10.1007/3540617795_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61779-2
Online ISBN: 978-3-540-70741-7
eBook Packages: Springer Book Archive