Skip to main content
SpringerLink
Log in

The relative complexity of analytic tableaux and SL-resolution

  • Published:
Studia Logica Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. W. Bibel,Automated Theorem Proving, Vieweg Verlag, Braunschweig; Wiesbaden: Vieweg 1982.

    Google Scholar 

  2. C. L. Chang andR. T. C. Lee,Symbolic Logic and Mechanical Theorem Proving, New York 1973.

  3. S. A. Cook,The Complexity of Theorem Proving Procedures,Proc. 3rd ACM STOC, 1971, pp. 151 – 158.

  4. S. A. Cook andR. A. Reckhow,The Relative Efficiency of Propositional Proof Systems Journal of Symbolic Logic,44 (1979), pp. 36–50.

    Google Scholar 

  5. M. D'Agostino,Investigations into the Complexity of some Propositional Calculi Ph.D. Thesis, Oxford University Computing Laboratory, Technical Monograph PRG-88, 1990.

    Google Scholar 

  6. D. E. Knuth,The Art of Computer Programming, Vol.1, Addison-Wesley, 1968.

  7. R. Kowalski andD. Kuehner,Linear Resolution with Selection Function Artificial Intelligence 2 (1971), pp. 227–260.

    Google Scholar 

  8. R. Smullyan,First Order Logic, Springer-Verlag, New York 1968.

    Google Scholar 

  9. A. Vellino,The Complexity of Automated Reasoning, Ph.D. Thesis, Department of Philosophy, University of Toronto, 1989.

Download references

Author information

Authors and Affiliations

  1. Computing Research Laboratory, Bell-Northern Research, Station C, P.O. Box 3511, K1Y 4H7, Ottawa, Ontario, CANADA

    André Vellino

Authors
  1. André Vellino
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01058395

Keywords

Search

Navigation