Abstract
The paper presents an original logical system for reasoning about groups of interacting, autonomous processes, i.e. multi-agent systems. In the paper, an agent is considered as a couple consisting of a set of methods and of a queue of tasks. We show that the logic is not decidable. It is done by the reduction from the recurring domino problem.
Get full access to this article
View all access options for this article.