Multi-agent temporary logic TS4KnU based at non-linear time and imitating uncertainty via agents' interaction

Abstract

This paper considers AI problems concerning reasoning in multi-agent environment. We introduce and study multi-agents' non-linear temporal logic TS4KnU 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. Main accent of our paper is modeling of logical uncertainty for statements via interaction of agents (passing knowledge). Conception of interacting agents is implemented via arbitrary finite paths of transitions by agents accessibility relations. We address problems decidability and satisfiability for TS4KnU. It is proved that TS4 KnU is decidable (and, in particular, the satisfiability problem for it is also decidable). We suggest an algorithm for checking satisfiability based on computation possibility of refutation special inference rues in finite models of effectively bounded size. © 2013 Springer-Verlag.