Defense Technical Information Center (DTIC) · 1982 · 50 citations · 10 references
ComputingComputer ScienceFormal MethodsLogicTheory Of ComputationAutomated ReasoningDeductive ReasoningDeductive SystemsDirected Acyclic GraphsPredicate LogicTheorem ProvingAutomated Theorem ProvingAutomatic Theorem ProvingLogical DeductionProof SearchResolution Theorem ProvingResolutionsSearch Space Pruning
A new theorem-proving program, combining the use of non-clausal resolution and connection graphs, is described. The use of nonclausal resolution as the inference system eliminates some of the redundancy and unreadability of clause-based systems. The use of a connection graph restricts the search space and facilitates graph searching for efficient deduction. I
10
Theorem Proving via General Matings
Peter B. Andrews · Journal of the ACM · 1981 · 285 citations · Full text
A Proof Procedure Using Connection Graphs
Robert Kowalski · Journal of the ACM · 1975 · 255 citations · Full text
Non-resolution theorem proving
W. W. Bledsoe · Artificial Intelligence · 1977 · 231 citations
Wolfgang Bibel · Journal of the ACM · 1981 · 183 citations