Merge Path Improvements for Minimal Model Hyper Tableaux

Simple item page
dc.contributor.authorBaumgartner, Peter
dc.contributor.authorHorton, J. D.
dc.contributor.authorSpencer, Bruce
dc.date.accessioned2023-03-01T18:28:22Z
dc.date.available2023-03-01T18:28:22Z
dc.date.issued1998
dc.description.abstractWe combine techniques originally developed for refutational first-order theorem proving within the clause tree framework with techniques for minimal model computation developed within the hyper tableau framework. This combination generalizes well-known tableaux teclmiques like complement splitting and foldingup/down. We argue that this combination allows for efficiency improvements over previous, related methods. It is motivated by application to diagnosis tasks; in particular the problem of avoiding redundancies in the diagnoses of electrical circuits with reconvergent fanouts is addressed by the new technique. In the paper we develop as our main contribution in a more general way a sound and complete calculus for propositional circumscriptive reasoning in the presence of minized and varying predicates.
dc.description.copyrightCopyright @ Peter Baumgartner, J.D. Horton, Bruce Spencer, 1998
dc.identifier.urihttps://unbscholar.lib.unb.ca/handle/1882/14840
dc.rightshttp://purl.org/coar/access_right/c_abf2
dc.subject.disciplineComputer Science
dc.titleMerge Path Improvements for Minimal Model Hyper Tableaux
dc.typetechnical report

Files

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

Collections

Research Reports