IEEE Transactions on Computers · 1976 · 28 citations · 9 references
ComputingComputer ScienceFormal MethodsKnowledge RepresentationLogicAutomated ReasoningDeductive ReasoningDeductive SystemsFormal SemanticsProof TheoryTheorem ProvingAutomated Theorem ProvingAutomatic Theorem ProvingFormal Proof SystemsInference RulesProof AutomationProof Search
A semantic and deductive formal system for automatic theorem proving is presented. The system has, as its deductive component, a form of natural deduction. Its semantic component relies on an underlying representation of a model. This model is invoked to prune subgoals generated by the deductive component, whenever such subgoals test false in the model. In addition, the model is used to suggest inferences to be made at the deductive level. Conversely, the current state of the proof suggests changes to be made to the model, e.g., when a construction is required as in geometry.
9
A Computing Procedure for Quantification Theory
Martin Davis, Hilary Putnam · Journal of the ACM · 1960 · 2.6K citations · Full text
H. Wang · IBM Journal of Research and Development · 1960 · 280 citations
The Concept of Demodulation in Theorem Proving
L. Wos, George Robinson, Daniel F. Carson et al. · Journal of the ACM · 1967 · 182 citations · Full text
Automatic Theorem Proving With Renamable and Semantic Resolution
James R. Slagle · Journal of the ACM · 1967 · 172 citations · Full text