Abstract
This paper describes the parallel automated theorem prover SPTHEO, a parallelization of the sequential first-order theorem prover SETHEO. The parallelization is based on the SPS-model (Static Partitioning with Slackness) for parallel search, an approach that minimizes the processor-to-processor communication. This model allows efficient computations on hardware with weak communication performance, such as workstation networks. SPTHEO offers the utilization of both OR- and independent-AND parallelism. In this paper, a detailed description and evaluation of the OR-parallel part are given.
Similar content being viewed by others
References
Ali, K. A. M. and Karlsson, R.: The MUSE OR-parallel Prolog model and its performance, in Proceedings of the 1990 North American Conference on Logic Programming, MIT Press, 1990.
Astrachan, O. L. and Loveland, D. W.: METEORs: High performance theorem provers using model elimination, in R. S. Boyer (ed.), Automated Reasoning: Essays in Honor of Woody Bledsoe, Kluwer Acad. Publ., Dordrecht, 1991.
Bose, S., Clarke, E. M., Long, D. E. and Michaylov, S.: Parthenon: A parallel theorem prover for non-Horn clauses, J. Automated Reasoning 8 (1992), 153-181.
Bonacina, M. P. and Hsiang, J.: Parallelization of deduction strategies: An analytical study, J. Automated Reasoning 13 (1994), 1-33.
Clocksin, W. F. and Alshawi, H.: A method for efficiently executing Horn clause programs using multiple processors, New Generation Comput. 5 (1988), 361-376.
Ertel, W.: OR-parallel theorem proving with random competition, in Proceedings of LPAR'92, LNAI 624, Springer, St. Petersburg, Russia, 1992, pp. 226-237.
Ertel, W.: Parallele Suche mit randomisiertem Wettbewerb in Inferenzsystemen, DISKI, 25, Infix-Verlag, 1993.
Hockney, R.: Performance parameters and benchmarking of supercomputers, Parallel Comput. 17 (1991), 1111-1130.
Holzinger, D.: Analysen zur Independent-AND Parallelisierung unter Berücksichtigung des SPS-Modells, Diplomarbeit, Institut für Informatik, Technische Universität München, 1993.
Huber, M.: Parallele Simulation des Theorembeweiser SETHEO unter Verwendung des Static Partitioning Konzepts, Diplomarbeit, Institut für Informatik, Technische Universität München, 1993.
Korf, R. E.: Depth-first iterative-deepening: An optimal admissible tree search, Artif. Intell. 27(1) (1985), 97-109.
Letz, R.: First-Order Calculi and Proof Procedures for Automated Deduction, Ph.D. Thesis, Technische Hochschule Darmstadt, 1993.
Letz, R., Mayr, K. and Goller, C.: Controlled integration of the cut rule into connection tableau calculi, J. Automated Reasoning 13(3) (1994), 297-337.
Loveland, D. W.: Mechanical theorem-proving by model elimination, J. ACM 15(2) (1968), 236-251.
Loveland, D. W.: Automated Theorem Proving: A Logical Basis, North-Holland, 1978.
Letz, R., Schumann, J., Bayerl, S. and Bibel, W.: SETHEO: A high-performance theorem prover, J. Automated Reasoning 8(2) (1992), 183-212.
Mayr, K.: Tableaubasierte Beweissysteme, Ph.D. Thesis, Technische Universität München, in preparation.
Schumann, J.: Efficient Theorem Provers based on an Abstract Machine, Ph.D. Thesis, Institut für Informatik, Technische Universität München, Germany, 1991.
Sun, X.-H. and Gustafson, J. L.: Toward a better parallel performance metric, Parallel Comput. 17 (1991), 1093-1109.
Schumann, J. and Letz, R.: PARTHEO: A high-performance parallel theorem prover, in Proceedings of the 10th International Conference on Automated Deduction (CADE), Springer LNAI 449, 1990, pp. 40-56.
Sturgill, D. B. and Segre, A.M.: A novel asynchronous parallelism scheme for first-order logic, in Proceedings of the Twelfth Conference on Automated Deduction, Springer LNAI 814, 1994.
Suttner, C. B. and Schumann, J.: Parallel automated theorem proving, in Parallel Processing for Artificial Intelligence 1, Machine Intelligence and Pattern Recognition 14, Elsevier, 1994, pp. 209-257.
Suttner, C. B. and Sutcliffe, G.: The TPTP Problem Library (TPTP v1.1.1 - TR Date 7.7.94), 1994, Technical Report AR-94-03, Institut für Informatik, Technische Universität München, Munich, Germany; Technical Report 93/11, Department of Computer Science, James Cook University, Townsville, Australia. Electronic copy via http://wwwjessen.informatik.tumuenchen.de/ftp/Automated_Reasoning/Reports/AR-94-03.ps.gz.
Sutcliffe, G., Suttner, C. B. and Yemenis, T.: The TPTP Problem Library, in A. Bundy (ed.), Proceedings of the 12th International Conference on Automated Deduction, LNAI 814, Springer-Verlag, 1994, pp. 252-266.
Stickel, M. E. and Tyson, W. M.: An analysis of consecutively bounded depth-first search with applications in automated deduction, in Proceedings of the 9th International Joint Conference on Artificial Intelligence (IJCAI-85), 1985.
Suttner, C. B.: Parallelization of Search-based Systems by Static Partitioning with Slackness, Ph.D. Thesis, Institut für Informatik, Technische Universität München. Published by Infix-Verlag, volume DISKI 101, Germany, 1995.
Suttner, C. B.: Static partitioning with slackness, in Parallel Processing for Artificial Intelligence 3, Elsevier, 1996, to appear.
Warren, D. H. D.: An abstract PROLOG instruction set, Technical report, SRI, AI Center, Menlo Park, CA, USA, 1983. ?
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Suttner, C.B. SPS-Parallelism + SETHEO = SPTHEO. Journal of Automated Reasoning 22, 397–431 (1999). https://doi.org/10.1023/A:1006127022180
Issue Date:
DOI: https://doi.org/10.1023/A:1006127022180