# A Fibred Tableau Calculus for Modal Logics of Agents

Padmanabhan, V. and Governatori, G (2006). A Fibred Tableau Calculus for Modal Logics of Agents. In: Baldoni, Matteo and Endriss, Ulle, Declarative Agent Languages and Technologies IV, 4th International Workshop, DALT 2006. Declarative Agent Languages and Technologies IV, DALT 2006, Hakodate, Japan, (105-122). 8 May, 2006.

Attached Files (Some files may be inaccessible until you login with your UQ eSpace credentials)
Author Padmanabhan, V. Governatori, G A Fibred Tableau Calculus for Modal Logics of Agents Fully Published Paper Declarative Agent Languages and Technologies IV, DALT 2006    (ERA 2010 Rank B) 10.1007/11961536_8 Hakodate, Japan 8 May, 2006 Declarative Agent Languages and Technologies IV, 4th International Workshop, DALT 2006  (ERA 2012 Listed)   Check publisher's open access policy Declarative Agent Languages and Technologies IV  (ERA 2012 Listed)   Check publisher's open access policy Baldoni, Matteo Endriss, Ulle Berlin, Germany Springer-Verlag 2006 Lecture Notes in Computer Science 4327 1 978-3-540-68959-1 0302-9743 105 122 18 2006 eng In previous works we showed how to combine propositional multimodal logics using Gabbay's \emph{fibring} methodology. In this paper we extend the above mentioned works by providing a tableau-based proof technique for the combined/fibred logics. To achieve this end we first make a comparison between two types of tableau proof systems, (\emph{graph} $\&$ \emph{path}), with the help of a scenario (The Friend's Puzzle). Having done that we show how to uniformly construct a tableau calculus for the combined logic using Governatori's labelled tableau system \KEM. We conclude with a discussion on \KEM's features. 280402 Mathematical Logic and Formal Languages E1 780100 Non-oriented Research lablelled tableaux fibring BDI agents multi-modal logic E1 This is an author version of a work originally published as Vineet Padmanabhan and Guido Governatori (2006) A Fibred Tableau Calculus for Modal Logics of Agents, Lecture Notes in Computer Science 4327 : 105-122. DOI: 10.1007/11961536 Copyright 2006 Springer-Verlag. All rights reserved. The original publication is available at www.springerlink.com