Abstract
In this paper we describe an improvement of Smullyan's analytic tableau method for the propositional calculus-Improved Parent Clash Restricted (IPCR) tableau-and show that it is equivalent to SL-resolution in complexity.
Similar content being viewed by others
References
W. Bibel,Automated Theorem Proving, Vieweg Verlag, Braunschweig; Wiesbaden: Vieweg 1982.
C. L. Chang andR. T. C. Lee,Symbolic Logic and Mechanical Theorem Proving, New York 1973.
S. A. Cook,The Complexity of Theorem Proving Procedures,Proc. 3rd ACM STOC, 1971, pp. 151 – 158.
S. A. Cook andR. A. Reckhow,The Relative Efficiency of Propositional Proof Systems Journal of Symbolic Logic,44 (1979), pp. 36–50.
M. D'Agostino,Investigations into the Complexity of some Propositional Calculi Ph.D. Thesis, Oxford University Computing Laboratory, Technical Monograph PRG-88, 1990.
D. E. Knuth,The Art of Computer Programming, Vol.1, Addison-Wesley, 1968.
R. Kowalski andD. Kuehner,Linear Resolution with Selection Function Artificial Intelligence 2 (1971), pp. 227–260.
R. Smullyan,First Order Logic, Springer-Verlag, New York 1968.
A. Vellino,The Complexity of Automated Reasoning, Ph.D. Thesis, Department of Philosophy, University of Toronto, 1989.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Vellino, A. The relative complexity of analytic tableaux and SL-resolution. Stud Logica 52, 323–337 (1993). https://doi.org/10.1007/BF01058395
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01058395