An open research problem: strong completeness of R Kowalski's connection graph proof procedure

DOI10.1093/JIGPAL/10.1.85zbMATH Open0997.03013OpenAlexW2157528908MaRDI QIDQ4532365FDOQ4532365

Authors: Graham Wrightson, Jörg H. Siekmann 

Publication date: 4 June 2002

Published in: Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/jigpal/10.1.85

Recommendations

• scientific article; zbMATH DE number 1926639
• Decomposition of tautologies into regular formulas and strong completeness of connection-graph resolution
• On (strong) proper vertex-connection of graphs
• On the strong Arnol'd hypothesis and the connectivity of graphs
• Proving connectedness of isogeny graphs with strong approximation
• The strongly connected reliability of complete digraphs
• a counterexample to W. Bibel's and E. Eder's strong completeness result for connection graph resolution
• \(\sum\)-completeness and closed graph theorems
• scientific article; zbMATH DE number 33150
• scientific article; zbMATH DE number 4012656

zbMATH Keywords

completenesstheorem provingconfluencesoundnessrefutation procedureclause graph resolutionconnection graph proof procedure

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35)

Cited In (6)

• A new subsumption method in the connection graph proof procedure
• a counterexample to W. Bibel's and E. Eder's strong completeness result for connection graph resolution
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: An open research problem: strong completeness of R Kowalski's connection graph proof procedure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4532365)