Representation of information and satisfiability, algorithms for multi-agent logics


Тип публикации: доклад, тезисы доклада, статья из сборника материалов конференций

Конференция: KES International Conference on Knowledge-Based and Intelligent Information and Engineering Systems, KES 2020

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

Идентификатор DOI: 10.1016/j.procs.2020.08.008

Ключевые слова: deciding algorithms, many-valued logics, multi-agent logics, temporal logics

Аннотация: This paper studies logical properties of multi-agent logics based at relational models with elements of multi-agency. In particular, we introduce a multi-agent temporal logic PastL based at linear possible-worlds models with non-transitive and non-uniform accessibility relations. We consider the time directed to past, and use logicПоказать полностьюal operation Since for non-transitive accessibility; Several formalizations for the conception knowledge/agent's knowledge in terms of non-transitive time in past are suggested. A logics PastT based is this approach is studied, we consider main computational problems - satisfiability and decidability. Based at technique of reduced normal forms we solve these problems and find deciding algorithms. Several interesting open problems are suggested. In final part of the paper we extend obtained results on logics with different accessibility relations for different agents and consider the satisfiability problem for these logics. © 2020 The Authors. Published by Elsevier B.V.

Ссылки на полный текст


Журнал: Procedia Computer Science

Выпуск журнала: Vol. 176

Номера страниц: 70-77

ISSN журнала: 18770509

Издатель: Elsevier B.V.


  • Rybakov V.V. (Institute of Mathematics and Computer Science, Siberian Federal University, 79 Svobodny pr., Krasnoyarsk, 660041, Russian Federation, A.P. Ershov Institute of Informatics Systems SB RAS, Acad. Lavrentjev pr., 6, Novosibirsk, 630090, Russian Federation)

Вхождение в базы данных