Undecidability of a Multi-Agent Logic

Issue title: Concurrency Specification and Programming (CS&P'2002), Part 1

Article type: Research Article

Authors: Kacprzak, Magdalena

Affiliations: Bialystok University of Technology, Institute of Mathematics and Physics, 15-351 Bialystok, ul. Wiejska 45A, Poland

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.

Journal: Fundamenta Informaticae, vol. 54, no. 2-3, pp. 213-220, 2003