A Strong Completeness Result for a MAS Logic

Issue title: SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28–30 September 2005

Article type: Research Article

Authors: Kacprzak, Magdalena

Affiliations: Institute of Mathematics and Physics Białystok University of Technology Wiejska 45A, 15-351 Bialystok, Poland. E-mail: [email protected]

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.

Keywords: multi-agent systems, deductive system, completeness

Journal: Fundamenta Informaticae, vol. 72, no. 1-3, pp. 197-213, 2006