Merge path improvements for minimal model hyper tableaux

DOI10.1007/3-540-48754-9_9MaRDI QIDQ4263006zbMATH OpenFDO

Authors Peter Baumgartner, J. D. Horton, Bruce D. Spencer

Publication date 28 February 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48754-9_9

zbMATH Keywords

automated theorem provingclause treescomplement splittingdiagnosis of electrical circuits with reconvergent fanoutsfolding-up/downmerge pathsminimal model computationpropositional circumscriptive reasoning

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Fault detection; testing in circuits and networks (94C12)

Recommendations

• A tableau calculus for minimal model reasoning
• Hyper tableaux
• Tableaux for diagnosis applications
• Hyper tableau -- the next generation

Cited in

(1)

• First-order resolution methods for modal logics

This page was built for publication: Merge path improvements for minimal model hyper tableaux

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4263006)