Сибирский федеральный университет

Тип публикации: статья из журнала

Год издания: 2018

Идентификатор DOI: 10.1134/S0037446618040134

Ключевые слова: deciding algorithms, information, knowledge, multiagent logics, multivaluations, satisfiability, temporal logic

Аннотация: We study multiagent logics and use temporal relational models with multivaluations. The key distinction from the standard relational models is the introduction of a particular valuation for each agent and the computation of the global valuation using all agents’ valuations. We discuss this approach, illustrate it with examples, and demonstrate that this is not a mechanical combination of standard models, but a much more subtle and sophisticated modeling of the computation of truth values in multiagent environments. To express the properties of these models we define a logical language with temporal formulas and introduce the logics based at classes of such models. The main mathematical problem under study is the satisfiability problem. We solve it and find deciding algorithms. Also we discuss some interesting open problems and trends of possible further investigations. © 2018, Pleiades Publishing, Ltd.

Журнал: Siberian Mathematical Journal

Выпуск журнала: Vol. 59, Is. 4

Номера страниц: 710-720

ISSN журнала: 00374466

Издатель: Pleiades Publishing

• Rybakov V.V. (Institute of Mathematics and Informatics; Siberian Federal University, Krasnoyarsk, Russian Federation, A. P. Ershov Institute of Informatics Systems, Novosibirsk, Russian Federation)

• Scopus
• РИНЦ (eLIBRARY.RU)
• Web of Science Core Collection