Multi-agent logic based on temporary logic TS4Kn serving web search

Описание

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

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

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

Ключевые слова: interacting agents, multi-agents logic, non-linear temporal logic, temporal logic, Computability and decidability, Computation theory, Formal logic, Inference engines, Knowledge based systems, Multi agent systems, Transportation, World Wide Web, Kripke frames, Multi agent, Multi-agent logic, Non linear, Satisfiability, Satisfiability problems, Truth values, Intelligent agents

Аннотация: In this paper we study multi-agents' non-linear temporal logic TS4 K-n 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. Our framework uses conception of interacting agents implemented via aПоказать полностьюrbitrary finite paths of transitions by agents accessibility relations. Main problems we are dealing here are decidability and satisfiability problems for this logic. We prove that TS4n is decidable and that the satisfiability problem for it is also decidable. We suggest an algorithm for checking satisfiability based on computation truth values of special inference rues in finite models modeling web connections by transitive Kripke frames. © 2012 The authors and IOS Press. All rights reserved.

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

Издание

Журнал: ADVANCES IN KNOWLEDGE-BASED AND INTELLIGENT INFORMATION AND ENGINEERING SYSTEMS

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

Номера страниц: 108-117

Персоны

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