Login / Signup
An Open Research Problem: Strong Completeness of R. Kowalski's Connection Graph Proof Procedure.
Jörg H. Siekmann
Graham Wrightson
Published in:
Computational Logic: Logic Programming and Beyond (2002)
Keyphrases
</>
proof procedure
theorem proving
propositional logic
predicate calculus
first order logic
event calculus
proof procedures
abductive logic programming
automated reasoning
artificial intelligence
knowledge base
search space
data model