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

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

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

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

Ключевые слова: multi-agent logics, information, knowledge, temporal logic, multivaluations at relational models, satisfiability problem, solving algorithms

Аннотация: We consider a multi-agent logic based on linear temporal logic. This logic uses as the semantics relational temporal models with multi-valuations-the models have separate valuations for all agents. We introduce in the logical language two new intensional logical operations-plausibleanddominates-to capture the feature of uncertainty. The main mathematical problem we are dealing with is the satisfiability problem. We solve it and find deciding algorithm. In the final part of paper we discuss interesting open problems for possible further investigations.

Журнал: LOBACHEVSKII JOURNAL OF MATHEMATICS

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

Номера страниц: 243-251

ISSN журнала: 19950802

Место издания: NEW YORK

Издатель: MAIK NAUKA/INTERPERIODICA/SPRINGER

• Rybakov V. V. (Сибирский федеральный университет)

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