On the relative merits of path dissolution and the method of analytic tableaux

DOI10.1016/0304-3975(94)90089-2zbMath0809.03008OpenAlexW1991091007MaRDI QIDQ1331929

Erik Rosenthal, Neil V. Murray

Publication date: 29 March 1995

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90089-2

zbMATH Keywords

analytic tableauxpath dissolutionsemantic graphsspeedup of tableau deductions

Mathematics Subject Classification ID

Related Items (3)

A tableau prover for domain minimization ⋮ Reductions for non-clausal theorem proving ⋮ The proof complexity of analytic and clausal tableaux

Uses Software

• HARP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The intractability of resolution
• Tautology testing with a generalized matrix reduction method
• Mathematical thought. An introduction to the philosophy of mathematics
• Dissolution
• Systematization of finite many-valued logics through the method of tableaux
• Inference with path resolution and semantic graphs

This page was built for publication: On the relative merits of path dissolution and the method of analytic tableaux