Undecidability of a Multi-Agent Logic

Authors:
Magdalena Kacprzak
Affiliations:
Bialystok University of Technology, Institute of Mathematics and Physics, 15-351 Bialystok, ul. Wiejska 45A, Poland
Venue:
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 1
Year:
2003

Citing 9
Cited 2

Recurring dominoes: making the highly undecidable highly understandable

Selected papers of the international conference on "foundations of computation theory" on Topics in the theory of computation
Intention is choice with commitment

Artificial Intelligence
Temporal and modal logic

Handbook of theoretical computer science (vol. B)
On undecidability of propositional temporal logics on trace systems

Information Processing Letters
Reasoning about knowledge

Reasoning about knowledge
Communication and cooperation in agent systems: a pragmatic theory

Communication and cooperation in agent systems: a pragmatic theory
Algorithmic Logic

Algorithmic Logic
Collective intentions

Fundamenta Informaticae
Formalization of Multiagent Reasoning

PARELEC '02 Proceedings of the International Conference on Parallel Computing in Electrical Engineering

Representation of knowledge and uncertainty in temporal logic LTL with since on frames Z of integer numbers

KES'11 Proceedings of the 15th international conference on Knowledge-based and intelligent information and engineering systems - Volume Part I
Algorithm for Decision Procedure in Temporal Logic Treating Uncertainty, Plausibility, Knowledge and Interacting Agents

International Journal of Intelligent Information Technologies

Quantified Score

Hi-index	0.00

Visualization

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.