Тип публикации: статья из журнала (материалы конференций, опубликованные в журналах)
Год издания: 2008
Идентификатор DOI: 10.1007/978-3-540-69731-2_116
Ключевые слова: Decidability algorithms, Hybrid logics, Knowledge based reasoning, Multi-agent logic, Relational Kripke/Hintikka models, Agents, Artificial intelligence, Boolean functions, Chlorine compounds, Cybernetics, Information theory, Multi agent systems, Recursive functions, Soft computing, Temporal logic, Theorem proving, Decidability algorithms, Distributed knowledge, Exponential size, Global knowledge, Hybrid logics, Interacting agents, International conferences, Knowledge based reasoning, Linear temporal logics, Multi agents, Multi-agent logic, Reduced forms, Relational Kripke/Hintikka models, Satisfiability problem, Time clustering, Time points, Variations of, Computability and decidability
Аннотация: We introduce a multi-agent logic - a variant of the linear temporal logic LTL with embedded multi-agent knowledge with interacting agents. The logic is motivated by semantics based on potentially infinite runs with time points represented by clusters of states with distributed knowledge of the agents. We address properties of local and global knowledge modeled in this framework, consider modeling of interaction between agents by possibility to puss information from one agent to others via possible transitions within time clusters of states. Main question we are focused on is the satisfiability problem and decidability of the logic . Key result is proposed algorithm which recognizes theorems of (so we show that is decidable). It is based on verification of validity for special normal reduced forms of rules in models with at most triple exponential size in the testing rules. In the final part we discuss possible variations of the proposed logic. © 2008 Springer-Verlag Berlin Heidelberg.
Журнал: (22 June 2008 through 26 June 2008, Zakopane
Выпуск журнала: Vol. 5097 LNAI
Номера страниц: 1243-1253
Информация о публикациях загружается с сайта службы поддержки публикационной активности СФУ. Сообщите, если заметили неточности.