Wyniki wyszukiwania - BazTech

1

Evolution of Collective Commitment during Teamwork

Dunin-Kęplicz B., Verbrugge R.

Fundamenta Informaticae

|

2003

|

Vol. 56, nr 4

329-371

EN

In this paper we aim to describe dynamic aspects of social and collective attitudes in teams of agents involved in Cooperative Problem Solving (CPS). Particular attention is given to the strongest motivational attitude, collective commitment, and its evolution during team action. First, building on our previous work, a logical framework is sketched in which a number of relevant social and collective attitudes is formalized, leading to the plan-based definition of collective commitments. Moreover, a dynamic logic component is added to this framework in order to capture the effects of the complex actions that are involved in the consecutive stages of CPS, namely potential recognition, team formation, plan formation and team action. During team action, the collective commitment leads to the execution of agent-specific actions. A dynamic and unpredictable environment may, however, cause the failure of some of these actions, or present the agents with new opportunities. The abstract reconfiguration algorithm, presented in a previous paper, is designed to handle the re-planning needed in such situations in an efficient way. In this paper, the dynamic logic component of the logical framework addresses issues pertaining to adjustments in collective commitment during the reconfiguration process.

2

A Fixpoint Semantics and an SLD-Resolution Calculus for Modal Logic Programs

Nguyen L.A.

Fundamenta Informaticae

|

2003

|

Vol. 55, nr 1

63-100

EN

We propose a modal logic programming language called MProlog, which is as expressive as the general modal Horn fragment. We give a fixpoint semantics and an SLD-resolution calculus for MProlog in all of the basic serial modal logics KD, T, KDB, B, KD4, S4, KD5, KD45, and S5. For an MProlog program P and for L being one of the mentioned logics, we define an operator T_L,P, which has the least fixpoint I_L,P. This fixpoint is a set of formulae, which may contain labeled forms of the modal operator , and is called the leasta-model generator of P. The standard model of I_L,P is shown to be a least L-model of P. The SLD-resolution calculus for MProlog is designed with a similar style as for classical logic programming. It is sound and complete. We also extend the calculus for MProlog in the almost serial modal logics KB, K5, K45, and KB5.

3

Collective Intentions

Dunin-Kęplicz B., Verbrugge R.

Fundamenta Informaticae

|

2002

|

Vol. 51, nr 3

271-295

EN

In this paper the notion of collective intention in teams of agents involved in cooperative problem solving (CPS) in multiagent systems (MAS) is investigated. Starting from individual intentions, goals, and beliefs defining agents' local asocial motivational and informational attitudes, we arrive at an understanding of collective intention in cooperative teams. The presented definitions are rather strong, in particular a collective intention implies that all members intend for all others to share that intention. Thus a team is created on the basis of collective intention, and exists as long as this attitude between team members exists, after which the group may disintegrate. For this reason it is crucial that collective intention lasts long enough. Collective intentions are formalized in a multi-modal logical framework. Completeness of this logic with respect to an appropriate class of Kripke models is proved. Two versions of collective intentions are discussed in the context of different situations. It is assumed that these definitions reflect solely vital aspects of motivational attitudes, leaving room for case-specific extensions. This makes the framework flexible and not overloaded. Together with individual and collective knowledge and belief, collective intention constitutes a basis for preparing a plan, reflected in the strongest attitude, i.e., in collective commitment, defined and investigated in our other papers.

4

Intuitionistic Models of Arithmetic

Połacik T.

Scientific Issues of Jan Długosz University in Częstochowa. Mathematics

|

1999

|

Vol. 6

70--74