The relative complexity of analytic tableaux and SL-resolution

Studia Logica 52 (2):323 - 337 (1993)
  Copy   BIBTEX

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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,616

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2009-01-28

Downloads
22 (#606,933)

6 months
2 (#668,348)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

First-order logic.Raymond Merrill Smullyan - 1968 - New York [etc.]: Springer Verlag.
Symbolic logic and mechanical theorem proving.Chin-Liang Chang - 1973 - San Diego: Academic Press. Edited by Richard Char-Tung Lee.
Linear resolution with selection function.Robert Kowalski & Donald Kuehner - 1971 - Artificial Intelligence 2 (3-4):227-260.

Add more references