Completeness of Linear Refutation for Theories with Equality
- 1 January 1971
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 18 (1) , 126-136
- https://doi.org/10.1145/321623.321636
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Finding resolution proofs and using duplicate goals in and/or treesInformation Sciences, 1971
- The Unit Proof and the Input Proof in Theorem ProvingJournal of the ACM, 1970
- A Linear Format for Resolution With Merging and a New Technique for Establishing CompletenessJournal of the ACM, 1970
- A linear format for resolutionPublished by Springer Nature ,1970
- Experiments With a Multipurpose, Theorem-Proving Heuristic ProgramJournal of the ACM, 1968
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965