Тип публикации: статья из журнала
Год издания: 2021
Идентификатор DOI: 10.1134/S0037446621030137
Ключевые слова: temporal logic, multiagent logic, satisfiability problem, deciding algorithm, 510.64:510.65:510.66
Аннотация: Under study are the branching time temporal logics with temporal accessibility relations for the agents different in length and content. We find an algorithm for solving the problems of satisfiability and decidability of the logic through describing finite satisfiable models of computable size (through the size of the input formulaПоказать полностьюs). We remove the constraints on the size of all temporal accessibility intervals for the agents (to be all inside a common temporal accessibility interval at any local time point); i.e., all constraints can be arbitrary. Also, we formulate some open problems.
Журнал: SIBERIAN MATHEMATICAL JOURNAL
Выпуск журнала: Vol. 62, Is. 3
Номера страниц: 503-510
ISSN журнала: 00374466
Место издания: NEW YORK
Издатель: MAIK NAUKA/INTERPERIODICA/SPRINGER