Using rewriting rules for connection graphs to prove theorems
- 31 August 1979
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 12 (2), 159-178
- https://doi.org/10.1016/0004-3702(79)90015-8
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A Search Technique for Clause Interconnectivity GraphsIEEE Transactions on Computers, 1976
- Refutations by MatingsIEEE Transactions on Computers, 1976
- Refutation graphsArtificial Intelligence, 1976
- A Proof Procedure Using Connection GraphsJournal of the ACM, 1975
- Theorem proving with variable-constrained resolutionInformation Sciences, 1972
- Resolution graphsArtificial Intelligence, 1970
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965
- An improved proof procedure1Theoria, 1960