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

DOI10.1093/jigpal/10.1.85zbMath0997.03013OpenAlexW2157528908MaRDI QIDQ4532365

Graham Wrightson, Jörg H. Siekmann

Publication date: 4 June 2002

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

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

zbMATH Keywords

theorem provingcompletenessconfluencesoundnessrefutation procedureclause graph resolutionconnection graph proof procedure

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35)

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