Abstract
In general, the result of a sequence of resolution steps depends on the order, in which the clauses are used. There are, however, situations, for which this order is irrelevant Performing all possible resolutions thus leads to the generation of identical clauses. Hyperresolution is an approach that overcomes part of this problem. Still, there are well known examples for the deduction of identical clauses by permuting the order of resolution steps, to which hyperresolution does not apply. In this paper, it is shown that the reduncancy in these examples is inherent not in the participating clauses but rather in so called congruent links. Furthermore, a solution to the problem with generating redundant clauses is proposed.
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
Bläsius, K. H. amp; Biirckert, H. J. (1987). Deduktionssysteme. Oldenbourg Verlag, München.
Chang, C.L. amp; Lee, R.C. (1973). Symbolic Logic and Mechanical Theorem Proving. Academic Press. New York.
Eisinger, N. (1981). Subsumption and Connection Graphs. Proceedings of the 7th IJCAI, Vancouver, 480–486.
Eisinger, N. (1988). Completeness, Confluence, and Related Properties of Clause Graph Resolution. PhD thesis and SEKI- Report SR-88-07, Universität Kaiserslautern.
Guard, J. et al (1969). Semi-Automated Mathematics. Journal of the ACM. 16,49–62.
Kowalski, R. (1975). A Proof Procedure Using Connection Graphs. Journal of the ACM, 22/4, 572–595.
Lüneburg, H. (1976). Ringtheorie. Universität Kaiserslautern.
Ohlbach, H.J. (1987). Link Inheritance in Abstract Clause Graphs. Journal of Automated Reasoning. 3/1,1–34.
Ohlbach, H.J. (1988). Using Automated Reasoning Techniques for Deductive Databases. SEKI-Report SR-88-06, Universität Kaiserslautern.
Robinson, J.A. (1965). Automated Deduction with Hyper-Resolution. Intern. Journal of Comp. Mathematics, 1, 227–234.
Socher-Ambrosius, R. (1989). Detecting Redundancy Caused by Congruent Links in Clause Graphs. SEKI-Report SR-88- 06. Universität Kaiserslautern.
Stickel, M. E. (1985). Automated Deduction by Theory Resolution. Journal of Automated Reasoning. 1/4, 333–356.
Wos, L. (1988). Automated Reasoning: 33 Basic Research Problems. Prentice Hall, Englewood Cliffs.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Socher-Ambrosius, R. (1989). Detecting Redundancy Caused by Congruent Links in Clause Graphs. In: Metzing, D. (eds) GWAI-89 13th German Workshop on Artificial Intelligence. Informatik-Fachberichte, vol 216. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-75100-4_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-75100-4_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51743-6
Online ISBN: 978-3-642-75100-4
eBook Packages: Springer Book Archive