Show simple item record

Rybakov, Vladimir V.
V.Babenyshev, Sergej V.
2008-12-22T06:53:39Z
2008-12-22T06:53:39Z
2008-11
http://elib.sfu-kras.ru/handle/2311/828
In this paper we introduce a temporal multi-agent logic S4IA T , which implements interacting agents. Logic S4IA T is defined semantically as the set of all formulas of the appropriate propositional language that are valid in special Kripke models. The models are based on S4-like time frames, i.e., with reflexive and transitive time-accessibility relations. Agents knowledge-accessibility relations Ri, defined independently for each individual agent, are S5-relations on R-time clusters, and interaction of the agents consists of passing knowledge along arbitrary paths of such relations. The key result of the paper is an algorithm for checking satisfiability and recognizing theorems of S4IA T . We also prove the effective finite model property for the logic S4IA T .en
335253 bytes
application/pdf
enen
Сибирский федеральный университет. Siberian Federal Universityen
Журнал Сибирского федерального университета. Математика и физика. Journal of Siberian Federal University. Mathematics & Physicsen
2008 1 (4)en
multi-agent logicsen
tense logicsen
knowledge representationen
satisfiabilityen
decidabilityen
inferenceen
A Hybrid of Tense Logic S4T and Multi-Agent Logic with Interacting Agentsen
Journal Article
Published Journal Article
Vladimir V.Rybakov: Institute of Mathematics Siberian Federal University Krasnoyarsk, Svobodny 79, 660041, Russia, e-mail: V.Rybakov@mmu.ac.uk; Sergej V.Babenyshevy: Department of Computing and Mathematics Manchester Metropolitan University John Dalton Building, Chester Str., Manchester, M1 5GD, U.K., e-mail: S.Babenyshev@mmu.ac.uku
399-409
http://elib.sfu-kras.ru/bitstream/2311/828/1/%D1%80%D1%8B%D0%B1%D0%B0%D0%BA%D0%BE%D0%B2_%D0%B1%D0%B0%D0%B1%D0%B5%D0%BD%D1%8B%D1%88%D0%B5%D0%B2.pdf


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record