A new subsumption method in the connection graph proof procedure (Q1199542): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Theorem Proving via General Matings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Matrices with Connections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5679729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the efficiency of subsumption algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Proof Procedure Using Connection Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3783626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new reduction rule for the connection graph proof procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Oriented Logic Based on the Resolution Principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Search Technique for Clause Interconnectivity Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3804226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Concept of Weak Substitution in Theorem-Proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994754 / rank
 
Normal rank

Latest revision as of 16:18, 16 May 2024

scientific article
Language Label Description Also known as
English
A new subsumption method in the connection graph proof procedure
scientific article

    Statements