Skip to main content
Springer Nature Link
Log in

Parallel theorem provers An overview

  • Conference paper
  • First Online:
Parallelization in Inference Systems

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 590))

  • 155 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. O. L. Astrachan and D. W. Loveland. METEORs: High performance theorem provers using model elimination. Technical Report CS-1991-08, Dept, of CS, Duke University, Durham, North Carolina, 1991.

    Google Scholar 

  2. H. Alshawi and D. B. Moran. The Delphi Model and some preliminary experiments. In Proc. of 5th Int. Conf. and Symposium, pages 1578–1589. MIT-Press, 1988.

    Google Scholar 

  3. Robert Amthor. Simulation eines Beweisers auf einer Multi — Prozessorarchitektur. Master's thesis, Technische Universitä München, 1989.

    Google Scholar 

  4. J. Boyle, R. Butler, T. Disz, B. Glickfled, E. Lusk, and et.al. Portable Programs for Parallel Processors. Holt, Rinehart, Winston, New York, 1987.

    Google Scholar 

  5. Th. Bemmerl, A. Bode, Th. Ludwig, and S. Tritscher. MMK — Multiprocessor Multitasking Kernel (User's Guide and User's Reference Manual). SFB Bericht Nr. 342/26/90A, Technische Universität München, 1990.

    Google Scholar 

  6. Soumitra Bose, Edmund M. Clarke, David E. Long, and Spiro Michaylov. Parthenon: A Parallel Theorem Prover for Non-Horn Clauses. Journal of Automated Reasoning, 1989.

    Google Scholar 

  7. S. Bayerl, W. Ertel, F. Kurfeß, and J. Schumann. PARTHEO/3: Experimentation with PARallel Automated THEOrem Prover Based on the Connection Method for Horn Clause Logic. ESPRIT 415F Deliverable D12, 1987.

    Google Scholar 

  8. J. Beer and W. K. Giloi. POPE — a Parallel-Operating Prolog Engine. Future Comp. Systems, 3:83–92, 1987.

    Google Scholar 

  9. W. Bibel. Automated Theorem Proving. Vieweg Verlag, Braunschweig, second edition, 1987.

    Google Scholar 

  10. Uri Baron, Bounthara Ing, Michael Ratcliffe, and Philippe Robert. A distributed architecture for the PEPSys parallel logic programming system. In Int. Conference on Parallel Processing, Chicago, 1988.

    Google Scholar 

  11. W. Bibel, F. Kurfeß, K. Aspetsberger, P. Hintenaus, and J. Schumann. Parallel inference machines. In Future Parallel Computers, pages 185–226. Springer Verlag, 1986.

    Google Scholar 

  12. U. Baron, J. C. de Kergommeaux, M. Hailperin, M. Ratcliffe, M. Robert, J.-Cl. Syre, and H. Westphal. The parallel ECRC Prolog System PEPSys: An Overview and Evaluation Results. In Future Generation Computing Systems, 1988.

    Google Scholar 

  13. W. F. Clocksin. Principles of the DelPhi Parallel Inference Machine. Comp. Journal, 30(5):386–392, 1987.

    Google Scholar 

  14. H. Fujita and R. Hasegawa. A model generation theorem prover in KL1 using a ramified-stack algorithm. Technical Report TR-606, ICOT, Tokyo, Japan, 1990.

    Google Scholar 

  15. Bertram Fronhöfer and Franz Kurfeß. Cooperative competition: A modest proposal concerning the use of multi-processor systems for automated reasoning. Technical report, Technische Universität München, 1987.

    Google Scholar 

  16. Joan Georgescu. Implicit parallelism in reactive memory based inference processors. Technical report, Inst. for Computers and Informatics, Dept. of Robotics and AI, Bucharest, Romania, 1986.

    Google Scholar 

  17. Joan Georgescu. An inference processor based on reactive memory. TR AI-FD063, Inst. for Computers and Informatics, Dept. of Robotics and AI, Bucharest, Romania, 1986.

    Google Scholar 

  18. Joan Georgescu. PKPS — a parallel knowledge processing system. Technical report, Inst. for Computers and Informatics, Dept. of Robotics and AI, Bucharest, Romania, 1986.

    Google Scholar 

  19. Joan Georgescu. PKPS — a parallel knowledge processing system for reasoning with knowlegde and belief. Technical report, Inst. for Computers and Informatics, Dept. of Robotics and AI, Bucharest, Romania, 1986.

    Google Scholar 

  20. R. Hasegawa, H. Fujita, and M. Fujita. A parallel theorem prover in KL1 and its application to program synthesis. Technical Report TR-588, ICOT, Tokyo, Japan, 1990.

    Google Scholar 

  21. M. R. Jobmann and Schumann J. Modelling and performance analysis of a parallel theorem prover. In A. Lehmann and F. Lehmann, editors, Messung, Modellierung und Bewertung von Rechensystemen, volume 286 of Informatik Fachberichte, pages 228–243, Neubiberg, Sep 1991. 6. GI/ITG-Fachtagung, Springer.

    Google Scholar 

  22. F. Kurfeß. Parallelism in Logic — Its Potential for Performance and Program Development. PhD thesis, Technische Universität München, 1990.

    Google Scholar 

  23. S. H. Lavington. Technical overview of the Intelligent File Store. Technical report, Department of Computer Science, University of Essex, Colchester, UK, 1988.

    Google Scholar 

  24. Ewing Lusk and William McCune. Tutorial on high-performance automated theorem proving. In CADE 10, page 681. Springer Verlag, 1990.

    Google Scholar 

  25. D. W. Loveland. Automated Theorem Proving: a Logical Basis. North-Holland, 1978.

    Google Scholar 

  26. R. Letz, J. Schumann, S. Bayerl, and W. Bibel. SETHEO: A High-Performance Theorem Prover. Technical report, Technische Universität München, 1990. To appear in Journal of Automated Reasoning.

    Google Scholar 

  27. R. Manthey and F. Bry. SATCHMO: a theorem prover implemented in Prolog. In Conference on Automated Deduction (CADE), 1988.

    Google Scholar 

  28. W. McCune. OTTER users' guide. Technical report, Mathematics and Computer Sci. Division, Argonne National Laboratory, Argonne, Ill., USA, 1988.

    Google Scholar 

  29. K. Nakajima, Y: Inamura, N. Ichyoshi, K. Rokusawa, and T. Chikayama. Distributed implementation of KL1 on the Multi-PSI/V2. In Proc. of 6th Intern. Conf. on Logic Programming (ICLP), 1989.

    Google Scholar 

  30. D. Prawitz. A Proof Procedure with Matrix Reduction. In Symposium on Automatic Demonstration, Lecture Notes in Mathematics 125, pages 207–214. Springer, 1970.

    Google Scholar 

  31. E. Shapiro. The family of concurrent logic programming languages, acm computing surveys, 21(3):412–510, 1989.

    Google Scholar 

  32. M. E. Stickel. A Prolog Technology Theorem Prover: Implementation by an Extended Prolog Compiler. Journal of Automated Reasoning, 4:353–380, 1988.

    Google Scholar 

  33. Kasumi Susaki. KL1 Programming. Technical Report TM-949, ICOT, Tokyo, Japan, 1989.

    Google Scholar 

  34. Jiwei Wang. Towards a new computational model for logic languages. Tech-rept CSM-128, Dept. of CS, University of Essex, 1989.

    Google Scholar 

  35. D. H. D. Warren. An Abstract PROLOG Instruction Set. Technical report, SRI, Menlo Park, Ca, USA, 1983.

    Google Scholar 

  36. D. H. D Warren. The SRI model for OR-parallel execution of Prolog — abstract design and implementation issues. In International Symposion on Logic Programming, pages 92–102, 1987.

    Google Scholar 

  37. Michael J. Wise. Prolog Multiprocessors. Prentice Hall, 1986.

    Google Scholar 

  38. G. A. Wilson and J. Minker. Resolution, Refinements, and Search Strategies: a Comparative Study. IEEE Transactions on Computers, C-25:782–801, 1976.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Technische Universität München, Augustenstr. 46, D-8000, München 2, Germany

    Johann M. Ph. Schumann

Authors
  1. Johann M. Ph. Schumann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

B. Fronhöfer G. Wrightson

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schumann, J.M.P. (1992). Parallel theorem provers An overview. In: Fronhöfer, B., Wrightson, G. (eds) Parallelization in Inference Systems. Lecture Notes in Computer Science, vol 590. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55425-4_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-55425-4_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55425-7

  • Online ISBN: 978-3-540-47066-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics