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

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

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

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

Ключевые слова: computability, decidability, deciding algorithms, information, multiagent logic, nontransitive time, satisfiability, temporal logic

Аннотация: Multiagent and temporal logics are active domains in Information Sciences, CS, and AI. Attention has predominantly focused on the logics based on transitive relational models, with particular emphasis on transitive time. But this does not seem rather reliable assumption. Nontransitivity of passing information may be demonstrated with relative ease through persuasive examples. Therefore, we introduce and study multiagent temporal logics that are based on nontransitive linear time. Another innovative step is consideration of incomplete information: the information/knowledge with lacunas,—the linear time with forgettable intervals of time in the past. Technically, the most important problems are problems of satisfiability and decidability of suggested logics. The main results are the algorithms that compute satisfiability and solve decidability (and so provide solutions to these problems). The paper concludes by posing a series of open problems. © 2017, Pleiades Publishing, Ltd.

Журнал: Siberian Mathematical Journal

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

Номера страниц: 875-886

ISSN журнала: 00374466

Издатель: Springer New York LLC

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

• Scopus
• Web of Science Core Collection
• Ядро РИНЦ (eLIBRARY.RU)
• Список ВАК