Chance discovery and analysis of data via multi-agent logics


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

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

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

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

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

Аннотация: We study applications of mathematical logic to Information Sciences in theirs particular part - Chance Discovery (which is a popular area in Knowledge Representation and CS). Main used tool is multi-agent logic based at modal-like temporal logic. In particular, we consider more thin case when the time is not supposed to be transitiПоказать полностьюve. The semantics of our logical approach is based at relational models for modelling computational processes and analysis of databases (with incomplete information, for instance, with information forgotten in the past, etc). We assume that the agent's accessibility relations may have lacunas; agents may have no access to some potentially known and stored information. Satisfiability and decidability issues are in focus of research. We find algorithms solving satisfiability problem. Illustrating examples are given and application areas are suggested. © 2019 The Author(s). Published by Elsevier B.V.

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


Журнал: Procedia Computer Science

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

Номера страниц: 884-891

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)

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