Multi-agent logic with distances based on linear temporal frames

Authors:
Vladimir Rybakov;Sergey Babenyshev
Affiliations:
Department of Computing and Mathematics, Manchester Metropolitan University, Manchester, UK;Department of Computing and Mathematics, Manchester Metropolitan University, Manchester, UK
Venue:
ICAISC'10 Proceedings of the 10th international conference on Artifical intelligence and soft computing: Part II
Year:
2010

Citing 8
Cited 1

Reasoning about knowledge

Reasoning about knowledge
Temporal verification of reactive systems: safety

Temporal verification of reactive systems: safety
Reasoning about The Past with Two-Way Automata

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Undecidability of a multi-agent logic

Fundamenta Informaticae - Concurrency specification and programming
Logical Consecutions in Intransitive Temporal Linear Logic of Finite Intervals

Journal of Logic and Computation
The temporal logic of programs

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
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
Logic of Discovery in Uncertain Situations--- Deciding Algorithms

KES '07 Knowledge-Based Intelligent Information and Engineering Systems and the XVII Italian Workshop on Neural Networks on Proceedings of the 11th International Conference

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper investigates a new temporal logic TLDistM, which combines temporal operations with the operations of localised agent's knowledge and operations responsible for measuring distances. The main goal is to construct a logical framework for modelling logical laws, which describe interactions between such operations. We consider issues of satisfiability and decidability for TLDistM. Our principal result is the algorithm which recognizes theorems of TLDistM, which implies that TLDistM is ecidable, and the satisfiability problem for TLDistM is solvable.