- Issue
- Journal of Siberian Federal University. Mathematics & Physics. 2013 6 (3)
- Authors
- McLean, David; Rybakov, Vladimir V.
- Contact information
- McLean, David: School of Computing, Mathematics and DT, Manchester Metropolitan University, Manchester M1 5GD, UK;; Rybakov, Vladimir V.: Institute of Mathematics and Computer Science, Siberian Federal University, Svobodny, 79, Krasnoyarsk, 660041 Russia; e-mail: V.Rybakov@mmu.ac.uk
- Keywords
- temporal logics; multi-agent logics; chance discovery; CD; Kripke-Hintikka models
- Abstract
Thispaperdescribeslogical models and computational algorithmsforlogical statements(specs) including various versions ofChanceDiscovery(CD).The approachisbased attemporal multi-agentlogic. Prime question is how to express most essential properties of CD in terms of temporal logic (branching time multi-agents’ logic or a linear one), how to define CD by formulas in logical language. We, as an example, introduce several formulas in the language of temporal multi-agent logic which may express essential properties of CD. Then we study computational questions (in particular, using some light modification of the standard filtration technique we show that the constructed logic has the finite-model property with effectively computable upper bound; this proves that the logic is decidable and provides a decision algorithm). At the final part of the paper we consider interpretation of CD via uncertainty and plausibility in an extension ofthelineartemporallogicLTL and computationfortruth values(satisfiability) ofits formulas.
- Pages
- 315-328
- Paper at repository of SibFU
- https://elib.sfu-kras.ru/handle/2311/9884
Journal of Siberian Federal University. Mathematics & Physics / Computing Truth of Logical Statements in Multi-Agents’ Environment
Full text (.pdf)