Clause Trees and Factor Paths

Simple item page
dc.contributor.authorHorton, J. D.
dc.contributor.authorSpencer, Bruce
dc.date.accessioned2023-03-01T18:26:46Z
dc.date.available2023-03-01T18:26:46Z
dc.date.issued1994
dc.description.abstractThe concept of a clause is generalized to that of a clause tree which shows how the clause can be proved from a set of input clauses. Procedures are provided to find factorizations and tautologies at build time using the internal structure of the tree. Model Elimination and SLI are specializations of this technique. Other resolution-based proof procedures, including bottom-up ones, could include these concepts to make better procedures. One example top-down procedure, ALPOC, has been implemented as part of Stickel's PTTP system. Content areas: automated reasoning, theorem proving, disjunctive logic programming
dc.description.copyrightCopyright @ J.D. Horton and Bruce Spencer, 1994.
dc.identifier.urihttps://unbscholar.lib.unb.ca/handle/1882/14625
dc.rightshttp://purl.org/coar/access_right/c_abf2
dc.subject.disciplineComputer Science
dc.titleClause Trees and Factor Paths
dc.typetechnical report

Files

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

Collections

Research Reports