Bottom up procedures to construct each minimal clause tree once

Simple item page
dc.contributor.authorHorton, J., D.
dc.contributor.authorSpencer, Bruce
dc.date.accessioned2023-03-01T18:26:49Z
dc.date.available2023-03-01T18:26:49Z
dc.date.issued1997
dc.description.abstractBottom up procedures are introduced for constructing only minimal clause trees. Two general methods are proposed. The first performs surgery on each non-minimal clause tree; the second ignores non-minimal clause trees and retains only minimal ones. By ranking open leaves and activating/deactivating leaves according to the ranking, the second method constructs each minimal clause tree exactly once. Methods for incorporating subsumption are described and a prototype system for propositional logic is compared against OTTER.
dc.description.copyrightCopyright @ J. D. Horton and Bruce Spencer, 1997.
dc.identifier.urihttps://unbscholar.lib.unb.ca/handle/1882/14634
dc.rightshttp://purl.org/coar/access_right/c_abf2
dc.subject.disciplineComputer Science
dc.titleBottom up procedures to construct each minimal clause tree once
dc.typetechnical report

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
item.pdf
Size:
580.03 KB
Format:
Adobe Portable Document Format
Download

Collections

Research Reports