Skip Navigation



Journal of Logic and Computation Advance Access published online on May 4, 2009
Journal of Logic and Computation, doi:10.1093/logcom/exp027
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Rybakov, V.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author, 2009. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Original Papers

Linear Temporal Logic LTLK extended by Multi-Agent Logic Kn with Interacting Agents

Vladimir Rybakov

Department of Computing and Mathematics, Manchester Metropolitan University, Manchester M1 5GD, UK and Siberian Federal University, Krasnoyarsk, Russia.
E-mail: v.rybakov{at}mmu.ac.uk

Received 13 June 2008.


  Abstract

We study an extension LTLK of the linear temporal logic LTLK by implementing multi-agent knowledge logic KD45m (which is often referred as multi-modal logic S5m). The temporal language of our logic adapts the operations U (until) and N (next) and uses new temporal operations: Uw—weak until, and Us—strong until. We also employ the standard agents’ knowledge operations Ki from the multi-agent logic KD45m and extend them with an operation IntK responsible for knowledge obtained via interaction of agents. The semantic models for LTLK are Kripke/Hintikka-like structures NC based on the linear time. Structures NC use i isin N as indexes for time, and the base set of any NC consists of clusters C(i) (for all i isin N) containing all possible states at the time i. Agents’ knowledge is modelled in time clusters C(i) via agents’ knowledge accessibility relations Rj. The logic LTLK is the set of all formulas which are valid (true) in all such models NC w.r.t. all possible valuations. We prove that LTLK is decidable: we reduce the decidability problem to verification of validity for special normal reduced forms of rules in specific models (not LTLK models) of size single-exponential in size of the rules. Furthermore, we extend these results to a linear temporal logic LTLK(Z) based on the time flow indexed by all integer numbers (with additional operations Since and Previous). Also we show that LTLK has the finite model property (fmp) while LTLK (Z) has no standard fmp.

Keywords: Linear temporal logic; modal logics multi-agent logic; interacting agents; decidability; algorithms; inference rules


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.