- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
A Tableau-Based Proof Method for Temporal Logics of Knowledge and Belief
Journal of Applied Non-Classical Logics 8 (3):225-258 (1998)
Abstract
ABSTRACT In this paper we define two logics, KLn and BLn, and present tableau-based decision procedures for both. KLn is a temporal logic of knowledge. Thus, in addition to the usual connectives of linear discrete temporal logic, it contains a set of unary modal connectives for representing the knowledge possessed by agents. The logic BLn is somewhat similar; it is a temporal logic that contains connectives for representing the beliefs of agents. In addition to a complete formal definition of the two logics and their decision procedures, the paper includes a brief review of their applications in AI and mainstream computer science, correctness proofs for the decision procedures, a number of worked examples illustrating the decision procedures, and some pointers to further workAuthor's Profile
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
A new algebraic semantic approach and some adequate connectives for computation with temporal logic over discrete time.Alfredo Burrieza & Inma P. De Guzmán - 1992 - Journal of Applied Non-Classical Logics 2 (2):181-200.
Cut-free sequent and tableau systems for propositional diodorean modal logics.Rajeev Goré - 1994 - Studia Logica 53 (3):433 - 457.
Decision procedures for some strong hybrid logics.Andrzej Indrzejczak & Michał Zawidzki - 2013 - Logic and Logical Philosophy 22 (4):389-409.
ExpTime Tableau Decision Procedures for Regular Grammar Logics with Converse.Linh Anh Nguyen & Andrzej Szałas - 2011 - Studia Logica 98 (3):387-428.
On the Mosaic Method for Many-Dimensional Modal Logics: A Case Study Combining Tense and Modal Operators. [REVIEW]Carlos Caleiro, Luca Viganò & Marco Volpe - 2013 - Logica Universalis 7 (1):33-69.
Terminating tableau systems for hybrid logic with difference and converse.Mark Kaminski & Gert Smolka - 2009 - Journal of Logic, Language and Information 18 (4):437-464.
An overview of tableau algorithms for description logics.Franz Baader & Ulrike Sattler - 2001 - Studia Logica 69 (1):5-40.
An Event-Based Fragment of First-Order Logic over Intervals.Savas Konur - 2011 - Journal of Logic, Language and Information 20 (1):49-68.
Relational dual tableaux for interval temporal logics.David Bresolin, Joanna Golinska-Pilarek & Ewa Orlowska - 2006 - Journal of Applied Non-Classical Logics 16 (3-4):251–277.
A loop-free decision procedure for modal propositional logics k4, s4 and S.Dorota Leszczyńska-Jasion - 2009 - Journal of Philosophical Logic 38 (2):151 - 177.
A tableau decision algorithm for modalized ALC with constant domains.Carsten Lutz, Holger Sturm, Frank Wolter & Michael Zakharyaschev - 2002 - Studia Logica 72 (2):199-232.
Extended Gentzen-type Formulations of Two Temporal Logics Based on Incomplete Knowledge Systems.Osamu Morikawa - 2001 - Notre Dame Journal of Formal Logic 42 (1):55-64.
Shortcuts and dynamic marking in the tableau method for adaptive logics.Diderik Batens & Joke Meheus - 2001 - Studia Logica 69 (2):221-248.
Analytics
Added to PP
2013-12-01
Downloads
46 (#336,891)
6 months
9 (#298,039)
2013-12-01
Downloads
46 (#336,891)
6 months
9 (#298,039)
Historical graph of downloads
Author's Profile
Citations of this work
Complete Axiomatizations for Reasoning about Knowledge and Branching Time.Ron van der Meyden & Ka-shu Wong - 2003 - Studia Logica 75 (1):93-123.
Complete axiomatizations for reasoning about knowledge and branching time.Ron van der Meyden & Ka-shu Wong - 2003 - Studia Logica 75 (1):93 - 123.
A general tableau method for propositional interval temporal logics: Theory and implementation.V. Goranko, A. Montanari, P. Sala & G. Sciavicco - 2006 - Journal of Applied Logic 4 (3):305-330.
Tableaux for logics of time and knowledge with interactions relating to synchrony.Clare Dixon, Cláudia Nalon & Michael Fisher - 2004 - Journal of Applied Non-Classical Logics 14 (4):397-445.
References found in this work
Reasoning about knowledge.Ronald Fagin, Joseph Y. Halpern, Yoram Moses & Moshe Vardi - 2003 - Cambridge, Mass.: MIT Press.
A guide to completeness and complexity for modal logics of knowledge and belief.Joseph Y. Halpern & Yoram Moses - 1992 - Artificial Intelligence 54 (3):319-379.
The tableau method for temporal logic: An overview.Pierre Wolper - 1985 - Logique Et Analyse 28 (110-111):119-136.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-7c76586df8-hc2g5 uwo