Abstract
Clause graphs, as they were defined in the 1970s, are graphs representing first order formulas in conjunctive normal form: the nodes are labelled with literals and the edges (links) connect complementary unifiable literals, i.e. they provide an explicit representation of the resolution possibilities. This report describes a generalization of this concept, called abstract clause graphs. The nodes of abstract clause graphs are still labelled with literals, the links however connect literals that are ‘unifiable’ relative to a given relation between literals. This relation is not explicitely defined, only certain abstract properties are required. For instance the existence of a special purpose unification algorithm is assumed, which computes substitutions, the application of which makes the relation hold for two literals.
When instances of already existing literals are added to the graph (e.g. due to resolution or factoring), the links to the new literals are derived from the links of their ancestors. An inheritance mechanism for such links is presented which operates only on the attached substitutions and does not have to unify the literals. The definition of abstract clause graphs and the theory about link inheritance is general enough to provide a framework so that as new ideas are proposed for graph based theorem provers, the methodology for both implementing links and proving their properties will be readily available.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bruynooghe, M., The Inheritance of Links in a Connection Graph, Report CW2 (1975). Applied Mathematics and Programming Division, Katholieke Universiteit Leuven.
Bläsius, K. H., Equality Reasoning in Clause Graphs, Proc. of IJCAI-83, Karlsruhe (1983).
Eisinger, N., Subsumption and Connection Graphs, Proc. of IJCAI-81, Vancouver (1981).
Herold, A., Some Basic Notions of First-Order Unification Theory, Interner Bericht 15/83, Inst. für Informatik I, Univ. of Karlsruhe, (1983).
Karl Mark G. Raph, The Markgraf Earl Refutation Procedure, Interner Bericht, Memo-Seki-MK-84-01, FB Informatik, Univ. of Kaiserslautern (1984).
Kowalski, R., A Proof Procedure Using Connection Graphs, JACM 22, 4, (1975).
Loveland, D., Automated Theorem Proving: A Logical Basis, North-Holland (1978).
Morris, J. B., E-Resolution: An Extension of Resolution to Include the Equality Relation. Proc. of IJCAI-69, 287–294 (dy1969).
Siekmann, J., Universal Unification, Proc. of CADE-84, Nappa USA. Springer (1984).
Schmidt-Schauss, M., A many-Sorted Calculus with Polymorphic Functions Based on Resolution and Paramodulation, Proc. of IJCAI-85, Los Angeles (1985).
StickelM. E., Automated deduction by theory resolution, Journal of Automated Reasoning 1, 333–355 (1985).
Siekmann, J. and Wrightson, G., Paramodulated Connection Graphs, Acta Informatica (1978).
Szabo, P., Unifikationstheorie erster Ordnung, Thesis, Inst. für Informatik I, Univ. of Karlsruhe (1982).
Walther, Ch., Elimination of Redundant Links in Extended Connection Graphs, Proc. of GWAI-81, Springer Fachberichte (1981) and Interner Bericht 10/81, University of Karlsruhe.
Walther, Ch., A Many-Sorted Calculus Based on Resolution and Paramodulation, Interner Bericht 34/82, Inst. für Informatik I, Univ. of Karlsruhe (1982). See also Proc. of IJCAI-83, Karlsruhe (1983).
Author information
Authors and Affiliations
Additional information
This research was supported by the Sonderforschungsbereich 314, Künstliche Intelligenz, of the German Research Agency.
Rights and permissions
About this article
Cite this article
Ohlbach, H.J. Link inheritance in abstract clause graphs. J Autom Reasoning 3, 1–34 (1987). https://doi.org/10.1007/BF00381143
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00381143