Abstract
A tableau is a refutation-based decision procedure for a related logic, and is among the most popular proof procedures for modal logics. In this paper, we present a labelled tableau calculus for a temporalised belief logic called TML +, which is obtained by adding a linear-time temporal logic onto a belief logic by the temporalisation method of Finger and Gabbay. We first establish the soundness and the completeness of the labelled tableau calculus based on the soundness and completeness results of its constituent logics. We then sketch a resolution-type proof procedure that complements the tableau calculus and also propose a model checking algorithm for TML + based on the recent results for model checking procedures for temporalised logics. TML + is suitable for formalising trust and agent beliefs and reasoning about their evolution for agent-based systems. Based on the logic TML +, the proposed labelled tableau calculus could be used for analysis, design and verification of agent-based systems operating in dynamic environments.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
