A new subsumption method in the connection graph proof procedure
type: Item
instance of: scholarly article
title: A new subsumption method in the connection graph proof procedure
zbMATH Open document ID: 0753.68083
DOI: 10.1016/0304-3975(92)90016-9
author: B. M. Kim
author: Jung Wan Cho
published in: Theoretical Computer Science
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 68T15
zbMATH DE Number: 94462
zbMATH Keywords: resolution
zbMATH Keywords: subsumption
MaRDI profile type: Publication
full work available at URL: 0304-3975(92)90016-9
OpenAlex ID: W1970102673
cites work: Theorem Proving via General Matings
cites work: On Matrices with Connections
cites work: Q5679729
cites work: On the efficiency of subsumption algorithms
cites work: A Proof Procedure Using Connection Graphs
cites work: Q3862380
cites work: Q3783626
cites work: Q4139711
cites work: A new reduction rule for the connection graph proof procedure
cites work: A Machine-Oriented Logic Based on the Resolution Principle
cites work: A Search Technique for Clause Interconnectivity Graphs
cites work: Q3804226
cites work: The Concept of Weak Substitution in Theorem-Proving
cites work: Q3994754
description: scientific article; zbMATH DE number 94462