Тип публикации: статья из журнала
Год издания: 2018
Идентификатор DOI: 10.17377/semi.2018.15.039
Ключевые слова: many-valued logic, multi-agent logic, temporal logic, computability, information, satisfiability, decidability, deciding algorithms, non-transitive time
Аннотация: We study many-valued temporal multi-agent logics based on non-transitive models. The semantical basis, i. e., relational models, are used for modelling of computational processes and analysis of databases with incomplete information, for instance, with information forgotten in the past. In the situation we consider, the agents' accПоказать полностьюessibility relations may have lacunas: agents may have no access to some potentially known and stored information. Yet innovative point is that in the relational models we consider various valuations Vi for agents' knowledge and a global valuation based on these valuations. Besides, agents' logical operations inside formulas may be nested, as a consequence they may interfere; that is, we consider not autonomous but cooperating agents. Satisfiability and decidability issues are discussed. We find algorithms solving satisfiability problem and hence we obtain the decidability of the decidability problem. Open problems are discussed.
Журнал: SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA
Выпуск журнала: Vol. 15
Номера страниц: 436-449
ISSN журнала: 18133304
Место издания: NOVOSIBIRSK
Издатель: SOBOLEV INST MATHEMATICS