Сибирский федеральный университет

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

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

Идентификатор DOI: 10.3233/978-1-61499-105-2-1593

Ключевые слова: CD, chance discovery, Kripke models, logics, modal logics, multi-agents, temporal logics, Computation theory, Computational linguistics, Formal logic, Knowledge based systems, Temporal logic, Kripke model, Modal logic, Multi agent, Multi agent systems

Аннотация: Our paper studies Chance Discovery (CD) in terms of temporal multi-agent logic. Prime question is how to express most essential properties of CD in terms of temporal branching time multi-agents' logic; how to define CD by formulas in this logical language.We, as an example, introduce several formulas in the language of temporal multi-agent logic which may express essential properties of CD. In the second part of this paper we study computational questions concerning suggested logic. Using some light modification of the standard filtration technique we show that the logic has the finite-model property with effectively computable upper bound. This proves that the logic is decidable and provides a decision algorithm. Thus, we may identify equivalence of statements about CD (in terms of suggested logic) and recognize satisfiable and contradictory statements. © 2012 The authors and IOS Press. All rights reserved.

Журнал: Advances in knowledge-based and intelligent information and engineering systems

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

Номера страниц: 1593-1601

• Rybakov V.V. (Institute of Mathematics,Siberian Federal University)

• Scopus
• Web of Science Core Collection
• Ядро РИНЦ (eLIBRARY.RU)