http://www.researchonline.mq.edu.au/vital/access/services/Feed ${session.getAttribute("locale")} 5 http://www.researchonline.mq.edu.au/vital/access/manager/Repository/mq:18063 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. 2012-03-13T16:50:07.218Z ]]> http://www.researchonline.mq.edu.au/vital/access/manager/Repository/mq:12383 For modelling and verifying agent systems, many researchers have proposed different logical systems. Since agent-based systems are designed to operate in dynamic environments such as the Internet, it is also important to model the temporal aspects of such systems in a systematic way. In this paper, we use a temporalised epistemic logic called TEL for formalising agent-based systems. We also propose a labelled tableau system and a model checking method for this logic. With logic TEL and its associated proof system, we are able to reason about, and verify agent systems operating in dynamic environments. 2011-04-01T04:40:12.053Z ]]>