What you always wanted to know about clause graph resolution
- 1 January 1986
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- A comparative study of several proof proceduresArtificial Intelligence, 1982
- Automated Theorem ProvingPublished by Springer Nature ,1982
- On Matrices with ConnectionsJournal of the ACM, 1981
- Theorem Proving via General MatingsJournal of the ACM, 1981
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- Using rewriting rules for connection graphs to prove theoremsArtificial Intelligence, 1979
- Refutations by MatingsIEEE Transactions on Computers, 1976
- A Proof Procedure Using Connection GraphsJournal of the ACM, 1975
- Linear resolution with selection functionArtificial Intelligence, 1972
- Resolution With MergingJournal of the ACM, 1968