Combining Rank/Activity with Set of Support, Hyperresolution and Subsumption
| dc.contributor.author | Horton, J., D. | |
| dc.contributor.author | Spencer, Bruce | |
| dc.date.accessioned | 2023-03-01T18:26:54Z | |
| dc.date.available | 2023-03-01T18:26:54Z | |
| dc.description.abstract | The rank/activity (R/A) restriction of binary resolution specifies that literals in clauses have ranks, and are either active (can be resolved) or inactive. When a literal is resolved, literals in the new clause, that were of lower rank in the parent clause than the resolved literal, become inactive in the child clause. Literals that merge or factor with literals from other clauses become active. Two derivations are equivalent if they consist of the same resolutions, possibly in a different order, but resulting in the same clause. It is known that with R/A, no two equivalent derivations are found (uniqueness), but that one derivation from each equivalence class is found. In !Jlls paper, R/A is combined with the set of support strategy, with hyperresolution, and also with subsumption. In the first two cases, both completeness and uniqueness are n;taintained. In the subsumption case, completeness and uniqueness can be retained if full rank/activity is kept, but subsumption of small clauses by bigger clauses is not done. With full subsumption, and a restricted version of R/A, completeness is kept but uniqueness is lost. | |
| dc.description.copyright | Copyright @ J. D. Horton and Bruce Spencer. | |
| dc.identifier.uri | https://unbscholar.lib.unb.ca/handle/1882/14653 | |
| dc.rights | http://purl.org/coar/access_right/c_abf2 | |
| dc.subject.discipline | Computer Science | |
| dc.title | Combining Rank/Activity with Set of Support, Hyperresolution and Subsumption | |
| dc.type | technical report |
Files
Original bundle
1 - 1 of 1