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.
CITATION STYLE
Rybakov, V. (2008). Multi-agent logics with interacting agents based on linear temporal logic: Deciding algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5097 LNAI, pp. 1243–1253). https://doi.org/10.1007/978-3-540-69731-2_116
Mendeley helps you to discover research relevant for your work.