Logic of plausibility for discovery in multi-agent environment deciding algorithms

Описание

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

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

Идентификатор DOI: 10.1007/978-3-540-85567-5-27

Ключевые слова: Decision algorithms, Hybrid logics, Kripke/Hintikka models, Linear temporal logic, Multi-agent's reasoning, Plausibility, Artificial intelligence, Computability and decidability, Knowledge based systems, Knowledge engineering, Models, Optical projectors, Temporal logic, Multi agent systems

Аннотация: In most popular hybrid logics from the field of Artificial Intelligence, knowledge is usually combined with other logical operations (e.g. awareness). We consider a hybrid logic LPD combining agent's knowledge operations, linear time, operations for discovering information and plausibility operation. The plausibility operation is sПоказать полностьюeemed to be quite new in this framework. The paper introduces LPD via semantical models based on special Kripke/Hintikka frames. We provide formation rules and rules for computing truth values of formulas in the chosen language inside such models, discuss properties of the described logic comparing to some other already known logics. The main problem we are focused on is finding an algorithm for recognition of satisfiable in LPD formulas, we propose such an algorithm (so we show that LPD is decidable w.r.t. satisfiability). The paper is completed with a short discussion on the essence and features of this algorithm. © 2008 Springer-Verlag Berlin Heidelberg.

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

Издание

Журнал: (3 September 2008 through 5 September 2008, Zagreb

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

Номера страниц: 210-217

Авторы

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

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