Тип публикации: статья из журнала
Год издания: 2022
Идентификатор DOI: 10.17516/1997-1397-2022-15-1-114-124
Ключевые слова: temporal logic, multi-agency, non-classical logics, information, knowledge representation, deciding algorithms, decidability, computability
Аннотация: We study an agents' temporal logic with non-standard none-transitive temporal accessibility relations and operations of static agents' knowledge. The main mathematical problem we work with is existence of algorithms for solving satisfiability problem. The problem is resolved and the algorithm is found. Some open problems are suggesПоказать полностьюted in the concluding part. We study an agents’ temporal logic with non-standard none-transitive temporal accessibility relations and operations of static agents’ knowledge. The main mathematical problem we work with is existence of algorithms for solving satisfiability problem. The problem is resolved and the algorithm is found. Some open problems are suggested in the concluding part. © Siberian Federal University. All rights reserved.
Журнал: JOURNAL OF SIBERIAN FEDERAL UNIVERSITY-MATHEMATICS & PHYSICS
Выпуск журнала: Vol. 15, Is. 1
Номера страниц: 114-124
ISSN журнала: 19971397
Место издания: KRASNOYARSK
Издатель: SIBERIAN FEDERAL UNIV