A Strong Completeness Result for a MAS Logic

Authors:
Magdalena Kacprzak
Affiliations:
Institute of Mathematics and Physics Białystok University of Technology Wiejska 45A, 15-351 Bialystok, Poland. E-mail: mkacprzak@interia.pl
Venue:
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Year:
2006

Citing 8
Cited 0

Temporal and modal logic

Handbook of theoretical computer science (vol. B)
Reasoning about knowledge

Reasoning about knowledge
Tractable multiagent planning for epistemic goals

Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 3
Algorithmic Logic

Algorithmic Logic
Alternating-Time Temporal Logic

COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Agents that Know How to Play

Fundamenta Informaticae - Multiagent Systems (FAMAS'03)
A Tuning Machine for Cooperative Problem Solving

Fundamenta Informaticae - Multiagent Systems (FAMAS'03)
Evolution of Collective Commitment during Teamwork

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper introduces an original formalization of distributed systems which work in a concurrent way, especially multi-agent systems (MAS). The described deductive system, called RA-MAS, is based on elements of branching time temporal logic, epistemic logic and algorithmic logic. The established operators and modalities allow to compare different multi-agent systems on the basis of the same formal system. Moreover, the logic provides tools for modelling and characterizing mental features of agents as well as different forms of cooperation. The main aim of the paper is to present axiomatization and prove a strong completeness result for the logic. The proof is inspired by a combination of the algebraic method of Rasiowa and Sikorski for classical logic with the Kripke method for modal logic.