An open research problem: strong completeness of R Kowalski's connection graph proof procedure
From MaRDI portal
Publication:4532365
DOI10.1093/jigpal/10.1.85zbMath0997.03013MaRDI 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
theorem proving; completeness; confluence; soundness; refutation procedure; clause graph resolution; connection graph proof procedure
03B35: Mechanization of proofs and logical operations