In this paper we study multi-agents’ non-linear temporal logic TS4K_n 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. Our framework uses conception of interacting agents implemented via arbitrary finite paths of transitions by agents accessibility relations. Main problems we are dealing here are decidability and satisfiability problems for this logic. We prove that TS4Kn is decidable and that the satisfiability problem for it is also decidable. We suggest an algorithm for checking satisfiability based on computation truth values of special inference rues in finite models modeling web connections by transitive Kripke frames.
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
Tel.: +1 703 830 6300
Fax: +1 703 830 2300 firstname.lastname@example.org
(Corporate matters and books only) IOS Press c/o Accucoms US, Inc.
For North America Sales and Customer Service
West Point Commons
Lansdale PA 19446
Tel.: +1 866 855 8967
Fax: +1 215 660 5042 email@example.com