Towards an advanced implementation of the connection method

Authors:
Wolfgang Bibel;Elmar Eder;Bertram Fronhoefer
Affiliations:
Institut fur Informatik, Technische Universitaet Muenchen, Muenchen;Institut fur Informatik, Technische Universitaet Muenchen, Muenchen;Institut fur Informatik, Technische Universitaet Muenchen, Muenchen
Venue:
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2
Year:
1983

Citing 4
Cited 1

The Concept of Weak Substitution in Theorem-Proving

Journal of the ACM (JACM)
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems

Journal of the ACM (JACM)
Mating in Matrices

GWAI '81 Proceedings of the German Workshop on Artificial Intelligence
Improvements of a Tautology-Testing Algorithm

Proceedings of the 6th Conference on Automated Deduction

Path-focused duplication: a search procedure for general matings

AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is intended to give a glance at some issues involved in implementing an advanced proof component based on the connection method. The material presented comprises contributions to the following problem domains: (a) Dealing with formulas In non-normal form, (b) The dynamic incorporation of unification into a proof procedure, (c) Controlling the generation of copies of clauses.