Bottom-up procedures for minimal clause trees

Simple item page
dc.contributor.authorHorton, J., D.
dc.contributor.authorSpencer, Bruce
dc.date.accessioned2023-03-01T18:29:58Z
dc.date.available2023-03-01T18:29:58Z
dc.date.issued1996
dc.description.abstractClause trees provide a basis for reasoning procedures .that use binary resolution. In this paper binary resolution trees are used as the data structure for implementing these procedures. Several properties of these procedures are explored: size, stages, minimality, disequalities, activity and rank. Procedures for uniquely building all minimal clause trees are introduced. Ordinary subsumption within these procedures does not preserve completeness, but contracting subsumption, a new restricted form of subsumption that relates to clause trees, can be integrated. The minimal restriction and unique construction address the problem of redundancy with binary resolution.
dc.description.copyrightCopyright @ J. D. Horton and Bruce Spencer, 1996.
dc.identifier.urihttps://unbscholar.lib.unb.ca/handle/1882/14962
dc.rightshttp://purl.org/coar/access_right/c_abf2
dc.subject.disciplineComputer Science
dc.titleBottom-up procedures for minimal clause trees
dc.typetechnical report

Files

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

Collections

Research Reports