A new subsumption method in the connection graph proof procedure

DOI10.1016/0304-3975(92)90016-9zbMath0753.68083OpenAlexW1970102673MaRDI QIDQ1199542

Jung Wan Cho, Byeong Man Kim

Publication date: 16 January 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(92)90016-9

zbMATH Keywords

resolutionsubsumption

Mathematics Subject Classification ID

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new reduction rule for the connection graph proof procedure
• On the efficiency of subsumption algorithms
• Theorem Proving via General Matings
• On Matrices with Connections
• A Search Technique for Clause Interconnectivity Graphs
• A Proof Procedure Using Connection Graphs
• The Concept of Weak Substitution in Theorem-Proving
• A Machine-Oriented Logic Based on the Resolution Principle

This page was built for publication: A new subsumption method in the connection graph proof procedure