Skip to main content
SpringerLink
Log in

Two Parallel Versions of the Connection Method for Propositional Logic on the L-Machine

  • Conference paper
GWAI-85

Part of the book series: Informatik-Fachberichte ((2252,volume 118))

Abstract

Two parallel versions of the Connection Method for propositional logic are presented in this paper. The first one has been implemented on the L-machine, which is an asynchronously working, universally programmable multi-microprocessor system.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Bibel W., 1982. Automated Theorem Proving, Friedr. Vieweg & Sohn, Braunschweig/Wiesbaden.

    Google Scholar 

  • Bibel W., 1983. Matings in Matrices. CACM 26, pp. 844–852.

    MathSciNet  MATH  Google Scholar 

  • Bibel W., Aspetsberger K., 1985. A Bibliography on Parallel Inference Machines. J. Symbolic Computation (1985), 1/1, p. 115–118.

    Article  MathSciNet  MATH  Google Scholar 

  • Bibel W., Buchberger B., 1984. Towards a Connection Machine for Logical Inference. First presented at: Int. Symp. on Fifth Generation and Super Computers, Rotterdam, Dec. 11–13, 1984. Appeared in: Future Generations Computer Systems, 1/3, p. 177–188, North Holland Publishing Company.

    Google Scholar 

  • Buchberger B., 1978. Computer Trees and their Programming. 4th Coll. “Trees in algebra and programming”, Univ. Lille, Feb. 16–18, p. 1–18.

    Google Scholar 

  • Buchberger B., 1983. Components for Restructurable Multi-Microprocessor Systems of Arbitrary Topology. MIMI 83, Lugano, Acta Press, Anaheim, p. 67–71.

    Google Scholar 

  • Buchberger B., 1984. The Present State of the L-Network Project. MIMI 84, Bari, Acta Press, Anaheim, p. 178–181.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technische Universität München, D-8000, München, Germany

    K. Aspetsberger

  2. Johannes Kepler Universität, A-4040, Linz, Austria

    K. Aspetsberger & S. Bayerl

Authors
  1. K. Aspetsberger
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Bayerl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Mathematische Maschinen und Datenverarbeitung VI, Friedrich-Alexander-Universität Erlangen-Nürnberg, Martensstraße 3, 8520, Erlangen, Deutschland

    Herbert Stoyan

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aspetsberger, K., Bayerl, S. (1986). Two Parallel Versions of the Connection Method for Propositional Logic on the L-Machine. In: Stoyan, H. (eds) GWAI-85. Informatik-Fachberichte, vol 118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-71145-9_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-71145-9_4

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-642-71145-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation