This paper presents a logical approach to formalization of some aspects of multi-agent systems in an incompletely known world. The contribution on this regard is as follows. We formalized reasoning about concurrent actions inside the situation calculus framework which has the sufficiently clear and well-understood semantics to express different aspects of agent theory. Conclusions can be drawn by default about results of a group of concurrent actions which may include unknown or unspecified actions. The approach allows to examine all models corresponding both to different assumptions about possible failures in performing of one or another action, and to assumptions whether a particular action was executed really. This provides an opportunity to predict the consequence of joint activity of agents operating in complex environment and to explain apparently unexpected changes. These results are achieved by choosing a suitable circumscription policy. The approach provides a general and formal framework for design and verification of wide class of agent-oriented systems such as telecommunication systems, network management, and evolving distributed data bases.
Soutchanski, M., & Ternovskaia, E. (1995). Logical formalization of concurrent actions for multi-agent systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 890, pp. 129–144). Springer Verlag. https://doi.org/10.1007/3-540-58855-8_8