Temporal Multi-Agents' Logics Modelling Dynamic Temporal Accessibility Relations | Научно-инновационный портал СФУ

Temporal Multi-Agents' Logics Modelling Dynamic Temporal Accessibility Relations

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

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

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

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

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

Аннотация: Here we continue our research connected with multi-agent logics and theirs applications to Information Sciences. We work with multi-agent logics based at relational models where time accessibility relations are not compulsory transitive and not compulsory are solid or continuous. We admit that time accessibility relations may have gaps or places of forgotten time. Several various approaches to formalizations paths of accessibility by time are suggested. Among them the case when each time state generates its own time - an interval of time which states are accepted as all the time accessible for any given agent in that time state. Variation of this approach when an external modelling initially introduced as all the times forgotten for the agent and not accessible for this agent at all. Also we study the case with time sates imitated as clusters of information states for current time. Examples of representation important properties concerning knowledge and information via logical formulas are provided. Mathematical results are formulated in terms of decidability and satisfiability problem, and existence of corresponding algorithms are stated. Open problems are suggested in the conclusion. © 2022 The Authors. Published by Elsevier B.V.

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

Издание

Журнал: Procedia Computer Science

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

Номера страниц: 475-482

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, Research University High School of Economics, Moscow, Russian Federation)

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

Информация о публикациях загружается с сайта службы поддержки публикационной активности СФУ. Сообщите, если заметили неточности.

Вы можете отметить интересные фрагменты текста, которые будут доступны по уникальной ссылке в адресной строке браузера.