Studia Logica 69 (1):171-191 (2001)
|Abstract||We define a tableau calculus for the logic of only knowing and knowing at most ON, which is an extension of Levesque's logic of only knowing O. The method is based on the possible-world semantics of the logic ON, and can be considered as an extension of known tableau calculi for modal logic K45. From the technical viewpoint, the main features of such an extension are the explicit representation of "unreachable" worlds in the tableau, and an additional branch closure condition implementing the property that each world must be either reachable or unreachable. The calculus allows for establishing the computational complexity of reasoning about only knowing and knowing at most. Moreover, we prove that the method matches the worst-case complexity lower bound of the satisfiability problem for both ON and O. With respect to , in which the tableau calculus was originally presented, in this paper we both provide a formal proof of soundness and completeness of the calculus, and prove the complexity results for the logic ON.|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
P. J. Martín & A. Gavilanes (2002). Simultaneous Rigid Sorted Unification for Tableaux. Studia Logica 72 (1):31-59.
Arthur Buchsbaum & Tarcisio Pequeno (1993). A Reasoning Method for a Paraconsistent Logic. Studia Logica 52 (2):281 - 289.
Stephen Hetherington (2008). Knowing-That, Knowing-How, and Knowing Philosophically. Grazer Philosophische Studien 77 (1):307-324.
Martin Amerbauer (1996). Cut-Free Tableau Calculi for Some Propositional Normal Modal Logics. Studia Logica 57 (2-3):359 - 372.
André Vellino (1993). The Relative Complexity of Analytic Tableaux and SL-Resolution. Studia Logica 52 (2):323 - 337.
Added to index2009-01-28
Total downloads4 ( #188,769 of 722,752 )
Recent downloads (6 months)0
How can I increase my downloads?