A Tableau-Based Proof Method for Temporal Logics of Knowledge and Belief
- 1 January 1998
- journal article
- research article
- Published by Taylor & Francis in Journal of Applied Non-Classical Logics
- Vol. 8 (3) , 225-258
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 work.Keywords
This publication has 10 references indexed in Scilit:
- Reasoning About Knowledge1995
- Temporal Verification of Reactive Systems1995
- What can machines know?Journal of the ACM, 1992
- A guide to completeness and complexity for modal logics of knowledge and beliefArtificial Intelligence, 1992
- The complexity of reasoning about knowledge and time. I. Lower boundsJournal of Computer and System Sciences, 1989
- Knowledge, belief and timeTheoretical Computer Science, 1988
- Using Reasoning About Knowledge to Analyze Distributed SystemsAnnual Review of Computer Science, 1987
- Proof Methods for Modal and Intuitionistic Logics1983
- Modal Logic1980
- First-Order Logic1968