Intention is choice with commitment
Artificial Intelligence
Handbook of theoretical computer science (vol. B)
On undecidability of propositional temporal logics on trace systems
Information Processing Letters
Reasoning about knowledge
Communication and cooperation in agent systems: a pragmatic theory
Communication and cooperation in agent systems: a pragmatic theory
Algorithmic Logic
Fundamenta Informaticae
Recurring Dominoes: Making the Highly Undecidable Highly Understandable (Preliminary Report)
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
Formalization of Multiagent Reasoning
PARELEC '02 Proceedings of the International Conference on Parallel Computing in Electrical Engineering
Decidability of Hybrid Logic with Local Common Knowledge Based on Linear Temporal Logic LTL
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Multi-agent Logics with Interacting Agents Based on Linear Temporal Logic: Deciding Algorithms
ICAISC '08 Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing
Multi-agent logic with distances based on linear temporal frames
ICAISC'10 Proceedings of the 10th international conference on Artifical intelligence and soft computing: Part II
A framework to compute inference rules valid in agents' temporal logics
KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part I
Inference rules in multi-agents' temporal logics
Transactions on computational collective intelligence IV
| Hi-index | 0.00 |
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.