Reexamining intractability of tableau methods

Authors:
N. V. Murray;E. Rosenthal
Affiliations:
Dept. of Computer Science, State Univ. of N.Y. at Albany, Albany, NY;Dept. of Mathematics, University of New Haven, West Haven, CT
Venue:
ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation
Year:
1990

Citing 7
Cited 2

Inference with path resolution and semantic graphs

Journal of the ACM (JACM)
HARP: a tableau-based theorem prover

Journal of Automated Reasoning
First-order modal tableaux

Journal of Automated Reasoning
Employing path dissolution to shorten tableaux proofs

ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
First-Order Theorem Proving Using Conditional Rewrite Rules

Proceedings of the 9th International Conference on Automated Deduction
An Implementation of a Dissolution-Based System Employing Theory Links

Proceedings of the 9th International Conference on Automated Deduction
On the lengths of proofs in the propositional calculus (Preliminary Version)

STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing

Dissolution: making paths vanish

Journal of the ACM (JACM)
CNF and DNF Considered Harmful for Computing Prime Implicants/Implicates

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the class of formulas on which the method of analytic tableaux was first shown to be intractable, and we show that with applications of the ordinary distributive law tableau methods admit linear time proofs for this class.We introduce a new class of formulas that are intractable for tableaux (even with the distributive law), and we demonstrate that path dissolution admits linear proofs of these formulas. Modifications of the tableau method are described that would render this class tractable. Since dissolution is linear on this class, these results demonstrate that dissolution cannot be p-simulated by the method of analytic tableau.