Abstract
A parallel connection graph proof procedure is described which is going to be implemented in CSSA, a new language for asynchronous multiprocessor systems.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
H.L. Fischer - P. Raulefs, “Design Rationale for the Interactive Programming Language CSSA for Asynchronous Multiprocessor Systems”, Memo SEKI-BN-79–09, Institut für Informatik III, Universität Bonn, 1979
R. Kowalski, “A Proof Procedure Using Connection Graphs”, JACM 22(1975), 572–595
N. Eisinger - J. Siekmann - G. Smolka - E. Unvericht - Chr. Walther, “The Markgraf Karl Refutation Procedure”, Proceedings of the AISB-80 conference, Amsterdam 1980
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hornung, G., Knapp, A., Knapp, U. (1981). A Parallel Connection Graph Proof Procedure. In: Siekmann, J.H. (eds) GWAI-81. Informatik-Fachberichte, vol 47. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-02328-0_14
Download citation
DOI: https://doi.org/10.1007/978-3-662-02328-0_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10859-7
Online ISBN: 978-3-662-02328-0
eBook Packages: Springer Book Archive