Abstract
Connection graph resolution is a refinement of resolution introduced by Kowalski in the early seventies /2/. However, it is still an open problem whether this proof rule (like resolution) is complete in the strong sense that for any unsatisfiable formula any sequence of selections of connections to be resolved upon leads to a refutation provided each connection has a finite chance to be selected.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
W. Bibel, On matrices with connections, Journal of ACM (to appear).
R. Kowalski, A proof procedure using connection graphs, Journal of ACM 22 (1975) 572–595.
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
Bibel, W. (1981). On the Completeness of Connection Graph Resolution. In: Siekmann, J.H. (eds) GWAI-81. Informatik-Fachberichte, vol 47. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-02328-0_22
Download citation
DOI: https://doi.org/10.1007/978-3-662-02328-0_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10859-7
Online ISBN: 978-3-662-02328-0
eBook Packages: Springer Book Archive