Agents' logics with common knowledge and uncertainty: Unification problem, algorithm for construction solutions

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

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

Идентификатор DOI: 10.1007/978-3-642-23851-2_18

Ключевые слова: agents' logic, common knowledge, multi-agent systems, uncertainty, unification, Common knowledge, Construction solutions, Logical equations, Logical operations, Solving algorithm, uncertainty, unification, Unification problem, Algorithms, Computability and decidability, Knowledge based systems, Multi agent systems, Intelligent agents

Аннотация: This paper studies agents' logics with operation uncertainty. Prime attention is paid to agents' common knowledge logics with logical operation uncertainty and logical unification in these logics. The unification problem is: for two arbitrary given formulas with meta-variables (coefficients) to answer whether they are unifiable, and if yes to construct a unifier. This problem is equivalent to problem of solvability logical equations with coefficients and finding theirs solutions. We show that the basic common knowledge logic with uncertainty operation (notation - CKLn,U) is decidable w.r.t. logical unification of the common knowledge formulas, and that for unifiable common knowledge formulas we can construct a unifier (we may describe solving algorithm). This result is extended to a wide class of logics expanding CKL n,U. © 2011 Springer-Verlag.

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

Издание

Журнал: (12 September 2011 through 14 September 2011, Kaiserslautern

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

Номера страниц: 171-179

Авторы

  • Rybakov V.V. (School of Computing, Mathematics and IT, Manchester Metropolitan University, Manchester M1 5GD, United Kingdom; Institutes of Mathematics, Siberian Federal University, Krasonoyarsk, Russian Federation)

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

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

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