Reducing search with minimal clause trees
| dc.contributor.author | Horton, J., D. | |
| dc.contributor.author | Spencer, Bruce | |
| dc.date.accessioned | 2023-03-01T18:30:22Z | |
| dc.date.available | 2023-03-01T18:30:22Z | |
| dc.date.issued | 1995 | |
| dc.description.abstract | The smallest and most efficient resolution based proof of a theorem is represented by a minimal clause tree, proposed by Horton and Spencer. A clause tree T is minimal if and only if it contains no legal tautology paths and no legal unchosen merge paths. A characterization of minimal clause trees is given in terms of derivations. A subsumption relationship between resolution based procedures is defined and all such procedures are shown to be subsumed by clause tree procedures. Three classes of procedures are proposed which produce only minimal clause trees. The first performs surgery on any clause tree that is produced to reduce it to a minimal clause tree. The second avoids any resolution that produces a clause tree on which surgery can be performed, but leaf to internal node paths are allowed to be chosen. The third, and most restrictive, avoids any resolution that produces a non-minimal clause tree. Keywords: theorem proving, reasoning (resolution), search. | |
| dc.description.copyright | Copyright @ J. D. Horton and Bruce Spencer, 1995. | |
| dc.identifier.uri | https://unbscholar.lib.unb.ca/handle/1882/14988 | |
| dc.rights | http://purl.org/coar/access_right/c_abf2 | |
| dc.subject.discipline | Computer Science | |
| dc.title | Reducing search with minimal clause trees | |
| dc.type | technical report |
Files
Original bundle
1 - 1 of 1