Тип публикации: доклад, тезисы доклада, статья из сборника материалов конференций
Конференция: KES International Conference on Knowledge-Based and Intelligent Information and Engineering Systems, KES 2020
Год издания: 2020
Идентификатор DOI: 10.1016/j.procs.2020.09.039
Ключевые слова: deciding algorithms, multi-agent logics, non-monotonicity many-valued logics
Аннотация: We study multi-agent logic modelling non-monotonic reasoning and taking decisions. Non-monotonicity is reflected by means of non-transitive agents' accessibility relations. The semantics is based at relational models for modelling computational processes and analysis of databases with incomplete information, for instance, with information forgotten in the past. Besides, the agents' accessibility relations may have lacunas; agents may have no access to some potentially known and stored information. Satisfiability and decidability issues are discussed. We find algorithms solving satisfiability problem. Illustrating examples are provided. © 2020 The Authors. Published by Elsevier B.V.
Издание
Журнал: Procedia Computer Science
Выпуск журнала: Vol. 176
Номера страниц: 670-674
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)
Вхождение в базы данных
Информация о публикациях загружается с сайта службы поддержки публикационной активности СФУ. Сообщите, если заметили неточности.