Formalization of multiagent reasoning

Author

Kacprzak, Magdalena

Author_Institution

Inst. of Math., Tech. Univ. of Bialystok, Poland

fYear

2002

fDate

2002

Firstpage

82

Lastpage

86

Abstract

The paper presents a new formal language for describing multiagent systems, which are collections of interacting, autonomous agents. The research work includes the description of the fundamental features of agents (processes) as well as the way they communicate with each other. The language defined in the paper allows describing the properties of systems such as deadlock, termination, and fairness. Two main results are presented for the defined logic: non-compactness of the semantic consequence relation and the lack of the deduction theorem. The article is an introduction to further research.

Keywords

concurrency control; formal languages; formal logic; inference mechanisms; multi-agent systems; deadlock; deduction theorem; fairness; formal language; interacting autonomous agents; logic; multiagent reasoning formalization; multiagent systems; semantic consequence relation; termination; Autonomous agents; Distributed computing; Formal languages; Logic; Mathematics; Multiagent systems; Software design; Software systems; System recovery; Telecommunication computing;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Computing in Electrical Engineering, 2002. PARELEC '02. Proceedings. International Conference on

Print_ISBN

0-7695-1730-7

Type

conf

DOI

10.1109/PCEE.2002.1115206

Filename

1115206