Skip to main content
Article thumbnail
Location of Repository

On the Relative Complexity of Labelled Modal Tableaux

By Guido Governatori

Abstract

The relative computational complexity of two free-variable labelled modal tableaux (\KEM and Single Step Tableaux, \SST) is investigated. We discuss the reasons why p-simulation is not a proper measure to compare tableaux-like proof systems, and we propose an improved comparison scale (p-search-simulation). It shown that \KEM p-search-simulates \SST while \SST cannot p-search-simulate \KEM

Year: 2001
OAI identifier: oai:CiteSeerX.psu:10.1.1.18.9931
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.itee.uq.edu.au/~gui... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.