Multi-agent temporary logic TS4KnU based at non-linear time and imitating uncertainty via agents' interaction

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

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

Идентификатор DOI: 10.1007/978-3-642-38610-7_35

Ключевые слова: interacting agents, multi-agents' logic, non-linear temporal logic, temporal logic, Bounded size, Finite model, Interacting agents, Multi agent, Multi-agent environment, Satisfiability, Satisfiability problems, Artificial intelligence, Inference engines, Model checking, Soft computing, Temporal logic, Uncertainty analysis, Computability and decidability

Аннотация: This paper considers AI problems concerning reasoning in multi-agent environment. We introduce and study multi-agents' non-linear temporal logic TS4KnU based on arbitrary (in particular, non-linear, finite or infinite) frames with reflexive and transitive accessibility relations, and individual symmetric accessibility relations Ri for agents. Main accent of our paper is modeling of logical uncertainty for statements via interaction of agents (passing knowledge). Conception of interacting agents is implemented via arbitrary finite paths of transitions by agents accessibility relations. We address problems decidability and satisfiability for TS4KnU. It is proved that TS4 KnU is decidable (and, in particular, the satisfiability problem for it is also decidable). We suggest an algorithm for checking satisfiability based on computation possibility of refutation special inference rues in finite models of effectively bounded size. © 2013 Springer-Verlag.

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

Издание

Журнал: (9 June 2013 through 13 June 2013, Zakopane

Выпуск журнала: Vol. 7895 LNAI, Is. PART 2

Номера страниц: 375-384

Авторы

  • McLean D. (School of Computing, Mathematics and DT,Manchester Metropolitan University,John Dalton Building)
  • Rybakov V. (Institute of Mathematics,Siberian Federal University)

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

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

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