Abstract
A new reduction rule is introduced for the connection graph proof procedure proposed by Kowalski in 1975. The new rule considers sets of values which clause variables may take. Application of the rule often leads to massive removals of links. A proof system in which the new rule is included has successfully been implemented in PROLOG. The performance of this system is compared to other resolution based proof systems. Also, the new rule is related to order-sorted logic.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bibel, W., ‘On Matrices with Connections.’ J ACM 28, 633–545 (1981).
Bläsius, K., Eisinger, N., Siekman, J., Smolka, G., Herold, A., and Walther, C., The Markgraph Karl Refutation Procedure (Fall 1981). Proc. of the Seventh Int. Joint Conf. on Artificial Intelligence, Vancouver, BC, Canada, pp. 511–518 (1981).
Boyer, R. S., Locking: a Restriction of Resolution. PhD dissertation, University of Texas, Austin, Texas (1971).
Bruynooghe, M., The inheritance of links in a connection graph. Report CW2. Applied Mathematics and Programming Division. Katholieke Universiteit Leuven (1975).
Chang, C., and Lee, R. C., Symbolic Logic and Mechanical Theorem Proving. Academic Press, London (1973).
Eisinger, N., ‘What You Always Wanted to Know about Clause Graph Resolution.’ 8th Int. Conf. on Automated Deduction, Oxford, England, pp. 316–336 (July 1986).
Huet, G., ‘Deduction and Computation.’ In Fundamentals of Artificial Intelligence, eds. W.Bibel and Ph.Jorrand, Springer, Berlin, 37–74 (1985).
Kowalski, R., ‘A Proof Procedure Using Connection Graphs.’ J ACM 22, 572–595 (1975).
Kowalski, R., Logic for Problem Solving. Artificial Intelligence Series. Vol. 7, North-Holland, New York (1979).
Smolka, G. Completeness of the Connection Graph Proof Procedure for Unit-Refutable Clause Sets. GWAI-82, 6th German Workshop on Artificial Intelligence, Bad Honnef, pp. 191–204 (Sept. 1982).
Stickel, M., Automated Deduction by Theory Resolution. Journal of Automated Reasoning, 1 333–355 (1985).
Stickel, M., ‘Schubert's Steamroller Problem: Formulations and Solutions.’ Journal of Automated Reasoning, 2, 89–101 (1986).
Walther, C., ‘A Mechanical Solution of Schubert's Steamroller by Many-Sorted Resolution.’ Journal of Artificial Intelligence, 26, 217–224 (1985).
Walther, C., ‘A Many-Sorted Calculus Based on Resolution and Paramodulation.’ Proc. of the Eighth Int. Joint Conf. on Artificial Intelligence, Karlsruhe, pp. 882–891 (1983).
Winker, S., ‘An Evaluation of an Implementation of Qualified Hyperresolution.’ IEEE Transactions on Computers C-25, pp. 835–843 (1976).
Wos, L., Veroff, R., Smith, B., and McCune, W., ‘The Linked Inference Principle, II: The user's viewpoint.’ Proc. of the 7th Int. Conf. on Automated Deduction, Napa, California, pp. 316–332 (1984).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Munch, K.H. A new reduction rule for the connection graph proof procedure. J Autom Reasoning 4, 425–444 (1988). https://doi.org/10.1007/BF00297248
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00297248