Login / Signup
An Open Research Problem: Strong Completeness of R. Kowalski's Connection Graph Proof Procedure.
Jörg H. Siekmann
Graham Wrightson
Published in:
Log. J. IGPL (2002)
Keyphrases
</>
proof procedure
theorem proving
propositional logic
first order logic
event calculus
predicate calculus
abductive logic programming
model theoretic
proof procedures
machine learning
artificial intelligence
natural language processing
deductive databases