Dissolution

DOI10.1145/174130.174135MaRDI QIDQ3140015zbMATH OpenOpenAlexFDO

Authors Neil V. Murray, Erik Rosenthal

Publication date 6 December 1993

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/174130.174135

zbMATH Keywords

deduction metatheoryinferencematrix methodspath dissolutionPrawitz analysisresolutionsemantic graphs

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 4072433
• On the relative merits of path dissolution and the method of analytic tableaux
• Tableaux, path dissolution, and decomposable negation normal form for knowledge compilation
• scientific article; zbMATH DE number 3988746
• scientific article; zbMATH DE number 4003561

Cited in

(12)

• On the relative merits of path dissolution and the method of analytic tableaux
• Clause trees: A tool for understanding and implementing resolution in automated reasoning
• Structured proof procedures
• scientific article; zbMATH DE number 3988746 (Why is no real title available?)
• scientific article; zbMATH DE number 4072433 (Why is no real title available?)
• scientific article; zbMATH DE number 67453 (Why is no real title available?)
• scientific article; zbMATH DE number 4003561 (Why is no real title available?)
• Reductions for non-clausal theorem proving
• A first polynomial non-clausal class in many-valued logic
• Linearity and regularity with negation normal form
• TPS: A hybrid automatic-interactive system for developing proofs
• Efficient query processing with reduced implicate tries

This page was built for publication: Dissolution

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