An Open Research Problem: Strong Completeness of R. Kowalski s Connection Graph Proof Procedure

Jörg H. Siekmann, Graham Wrightson. An Open Research Problem: Strong Completeness of R. Kowalski s Connection Graph Proof Procedure. Logic Journal of the IGPL, 10(1):85-103, 2002. [doi]

Abstract

Abstract is missing.