Journal of the ACM · 1971 · 63 citations · 6 references
ComputingComputer ScienceInformation RetrievalMergersNorm-referenced AssessmentCitation NetworksCitation PracticesResult Merging
Resolution with merging, linear format, and set of support is shown to be compatible with an A-ordering restriction; in any resolution operation under a linear format, the literal resolved upon in the near parent must be a maximal literal in that clause. The far parent must either be a merge, in which case the literal resolved upon must be a merge literal, or a member of the original set of clauses.
6
Automatic Theorem Proving With Renamable and Semantic Resolution
James R. Slagle · Journal of the ACM · 1967 · 172 citations · Full text
Peter B. Andrews · Journal of the ACM · 1968 · 66 citations · Full text