Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
C.Baral, M.Gelfond Representing concurrent actions in extended logic programming. Proc. of the 13th IJCAI, 1993, 866–871
J.M.Crawford, D.W. Etherington Formalizing Reasoning About Change: A Qualitative Reasoning Approach (Preliminary Report) In: Amer. Assoc. of Artif. Intell., 10th National Conference on Artif. Intell., 1992, 577–583.
B.Dunin-Keplicz, J.Treur Compositional formal specification of multi-agent systems, (this volume)
M.Gelfond, V.Lifschitz, A.Rabinov What are the limitations of the situation calculus? In: Essays for Bledsoe, (Ed. by R.Boyer), Kluwer Academic, 1991, 167–177
G.N.Kartha Soundness and completeness theorems for three formalisations of action. Proc. of the 13th IJCAI, 1993, 724–729
Ph.G.Kolaitis, Ch.H.Papadimitriou Some computational aspects of circumscription. J. of the ACM, 37, 1990, 1–14
K.Konolidge A first-order formalisation of knowledge and action for a multi-agent planning system. In: Machine Intelligence, v. 10, (Eds. J.E.Hayes, D.Michie, Y.-H.Pao), Chichester, Ellis Horwood Ltd., 1982, 41–71
V.Lifschitz Toward a metatheory of action. Proc. of the 2nd Int'l Conf. on Principles of Knowledge Representation and Reasoning, (Eds. J.Allen, R.Fikes, E.Sandewall), 1991, p.376–387
V.Lifschitz Computing circumscription. Proc. 9th IJCAI, 1985, 121–127
V.Lifschitz Pointwise circumscription: preliminary report. In: Amer. Assoc. of Artif. Intell., 5th National Conference on Artif. Intell., 1986, v.1, p. 406–410
F.Lin, R.Reiter State Constraints Revisited. J. of Logic and Computation, 4 (1994), (to appear)
E.Sandewall Filter preferential entailment for the logic of action in almost continuous worlds. Proc. of 11th IJCAI, 1989, 894–899
E.Sandewall Features and Fluents: A Systematic Approach to the Representation of Knowledge about Dynamical Systems. Technical Report LiTH-IDA-R-94-15, 1994 (to be published by Oxford Un. Press)
F.Lin, Y.Shoham. Concurrent actions in the situation calculus. In: Amer. Assoc. of Artif. Intell., 10th National Conference on Artif. Intell., 1992, v.1, p. 590–595
J.McCarthy, P.Hayes Some philosophical problems from the standpoint of artificial intelligence. In: Machine Intelligence, v. 4, (Eds. B.Meltzer and D.Michie), Edinburgh University Press, 1969, p. 463–502
J.McCarthy First order theories of individual concepts and propositions. In: Machine Intelligence, v. 9, (Eds. J.E.Hayes, D.Michie, L.I.Mikulich), Chichester, Ellis Horwood Ltd., 1979, p. 120–147
L.Morgenstern A first order theory of planning, knowledge, and action. In: Theoretial Aspects of Reasoning about Knowledge (Ed. by J.Halpern), Proc. of the conference held March 19–22, 1986, Morgan Kaufmann Publ.
R.Reiter The frame problem in the situation calculus: a simple solution (sometimes) and a completeness result for goal regression. In: Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy, Academic Press, San Diego (CA), 1991, 359–380.
M.Shanahan E-mail message N frigate.do.395 Date: Wednesday, 20th January 1993, 13:12:01.
M.E.Soutchanski, E.A.Ternovskaia Logical theory of concurrent actions. In: Soviet J. of Computer and System Sciences, 1993, vol.31.
E.A.Ternovskaia Interval situation calculus. Proc. of the W/Sh’ Logic and Change', held 8th August 1994, during 11th ECAI, 1994, 153–165
J.C.Weber On the representation of concurrent actions in the situational calculus. Proc. of the 8th Biennual Confer. of Canadian Society of Computat. Study of Intelligence, Ottava, 22–23 May, 1990, 28–32.
M.Wooldridge The logic of an agent-oriented testbed for DAI, (this volume)
M.Wooldridge, M.Fisher A first-order branching time logic of multi-agent systems. Proc. of the 10th ECAI, 1992, 234–238.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Soutchanski, M., Ternovskaia, E. (1995). Logical formalization of concurrent actions for multi-agent systems. In: Wooldridge, M.J., Jennings, N.R. (eds) Intelligent Agents. ATAL 1994. Lecture Notes in Computer Science, vol 890. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58855-8_8
Download citation
DOI: https://doi.org/10.1007/3-540-58855-8_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58855-9
Online ISBN: 978-3-540-49129-3
eBook Packages: Springer Book Archive