Тип публикации: статья из журнала
Год издания: 2020
Идентификатор DOI: 10.33048/semi.2020.17.068
Ключевые слова: temporal logic, non-classical logics, information, knowledge representation, deciding algorithms, computability, satisfiability, decidability, temporal logicsupported by rfbr and krasnoyarsk regional fund of science, research project 18-41-240005 and by the krasnoyarsk mathematical center and the ministry of science and higher education of the russian federation, research project 075-02-2020-1534/1
Аннотация: We study a temporal logic with non-standard temporal accessibility relations. This logic is generated by semantic underground models, and any such a model has a base formed by a frame with temporal relations generated by temporal states themselves; potentially, any state possesses its own temporal accessibility relation, and it is Показать полностьюpossible that all of them can be different. We consider this to be the most plausible modelling, because any time state has, in principle, its own view on what is past (or future). Time relations may have non-empty overlaps and they can be totally intransitive. Thus, this approach may be suitable for analysis of the most general cases of reasoning about computation, information flows, reliability, and other areas of AI and CS. The main mathematical question under consideration here is the existence of algorithms for solving satisfiability problems. Here we solve this problem and find the required algorithms. In the final part of our paper we formulate some interesting open problems.
Журнал: SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA
Выпуск журнала: Vol. 17
Номера страниц: 923-932
ISSN журнала: 18133304
Место издания: NOVOSIBIRSK
Издатель: SOBOLEV INST MATHEMATICS