Abstract
In this paper it is shown that R. Kowalski’s connection graph proof procedure /Ko75/ terminates with the empty clause for every unit-refutable clause set, provided an exhaustive search strategy is employed. This result holds for unrestricted tautology deletion, whereas subsumption requires certain precautions.
The results are shown for an improved version of the connection graph resolution rule which generates less links than the original one. The new inference rule not only leads to a smaller search space but it also permits a more efficient implementation.
The proofs are based on refutation trees as in /HR78/ and are applied immediately at the general level. Hence the unsolved problems resulting from the classical lifting techniques in the context of connection graphs are avoided.
Finally a counterexample is presented at the propositional level which shows that unrestricted deletion of tautologies destroys completeness for non-unit-refutable clause sets.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
W. BIBEL, A strong completeness result for the connection graph proof procedure. Technische Universität München, 1981.
W. BIBEL, On the completeness of connection graph resolution. Proc. of GWAI-81, Springer Informatik Fachberichte 47, 1981, 246–247.
W. BIBEL, On matrices with connections. J. ACM 28,4 (Oct. 1981), 633–645.
M. BRUYNOOGHE, The inheritance of links in a connection graph. Report CW2, Katho-like Universiteit Leuven, 1975.
F. BROWN, Notes on chains and connection graphs. Personal Notes, Dep. of Computation and logic, Edinburgh University, 1976.
C.L. CHANG, The unit proof and the input proof in theorem proving. J. ACM 17,4 (Oct. 197O), 698–7O7.
M.C. HARRISON and N. RUBIN, Another generalisation of resolution. J. ACM 25,3 (Oct. 1978), 341–351.
G. HUET, Confluent reductions: abstract properties and applications to term re-writing systems. J. ACM 27,4 (Oct. 1980), 797–821.
L. HENSCHEN and L. WOS, Unit refutations and Horn-sets. J. ACM 22,4 (Oct. 1974), 590–605.
R. KOWALSKI, A proof procedure using connection graphs. J. ACM 22,4 (Oct. 1975), 572–595.
R. KOWALSKI, Logic for problem solving. North Holland, 1979.
D. KUEHNER, Some special purpose resolution systems. 1972. In Meltzer and Michie (Eds), Machine intelligence 7. Edinburgh University Press, 1972.
D.W. LOVELAND, Automated theorem proving: a logical basis. North Holland, 1978.
H.J. OHLBACH, Terminator: an efficient proof procedure for unit-refutable clause sets. Universität Karlsruhe, Institut für Informatik I, to appear 1982.
R.E. SHOSTAK, Refutation graphs. Artif. Int. 7 (1976), 823–835.
G. SMOLKA, Einige Ergebnisse zur Vollständigkeit der Beweisprozedur von Kowalski. Diplomarbeit, Universität Karlsruhe, Institut für Informatik I, 1982.
J.H. SIEKMANN and W. STEPHAN, Completeness and soundness of the connection graph proof procedure. Universität Karlsruhe, Institut für Informatik I, 1976.
J.H. SIEKMANN and W. STEPHAN, Completeness and consistency of the connection graph proof procedure. Universität Karlsruhe, Institut für Informatik I, 1980.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Smolka, G. (1982). Completeness of the Connection Graph Proof Procedure for Unit-Refutable Clause Sets. In: Wahlster, W. (eds) GWAI-82. Informatik-Fachberichte, vol 58. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-68826-3_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-68826-3_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11960-9
Online ISBN: 978-3-642-68826-3
eBook Packages: Springer Book Archive