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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bibel W., 1982. Automated Theorem Proving, Friedr. Vieweg & Sohn, Braunschweig/Wiesbaden.
Bibel W., 1983. Matings in Matrices. CACM 26, pp. 844–852.
Bibel W., Aspetsberger K., 1985. A Bibliography on Parallel Inference Machines. J. Symbolic Computation (1985), 1/1, p. 115–118.
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.
Buchberger B., 1978. Computer Trees and their Programming. 4th Coll. “Trees in algebra and programming”, Univ. Lille, Feb. 16–18, p. 1–18.
Buchberger B., 1983. Components for Restructurable Multi-Microprocessor Systems of Arbitrary Topology. MIMI 83, Lugano, Acta Press, Anaheim, p. 67–71.
Buchberger B., 1984. The Present State of the L-Network Project. MIMI 84, Bari, Acta Press, Anaheim, p. 178–181.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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