Login / Signup

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

Jörg H. SiekmannGraham Wrightson
Published in: Log. J. IGPL (2002)
Keyphrases