Wyniki wyszukiwania - BazTech

1

Multi-Party Persuasion : a Paraconsistent Approach

Dunin-Kęplicz B., Powała A.

Fundamenta Informaticae

|

2018

|

Vol. 158, nr 1/3

1--39

EN

Some conflicts appearing in multi-agent settings may be resolved via communication. In this paper, besides conflicts of opinions, paradigmatically resolved by a persuasion dialogue, we study semantically deeper conflicts reaching to motivations of opinions. This investigation led us to discerning deep persuasion dialogues aiming at the resolution of conflicting motivations of opinions. In our overall research program we focus on realistic modeling of agency. This includes a proper representation of agents' ignorance and inconsistencies, appearing in their informational stance. Therefore, our formal framework TalkLOG, designed to provide and embed different forms of dialogues, employs a 4-valued logic with two additional logical values, unknown and inconsistent. Within TalkLOG soundness and completeness of persuasion was proved by comparing the outcomes of the persuasion dialogues performed by n-agents with the outcomes obtained by merging knowledge of these n agents. In this context the key point was a proper construction of this merge operator. Another critical issue is complexity of agents' communication, which is typically interleaved with reasoning in the context of multi-agent or autonomous systems. In TalkLOG tractability of both aspects is obtained thanks to the implementation tool: rule-based 4-valued query language 4QL.

2

Coordinating multiple rescue robots

Białek Ł., Szałas A., Borkowski A., Gnatowski M., Borkowska M. M., Dunin-Kęplicz B., Szklarski J.

Prace Naukowe Politechniki Warszawskiej. Elektronika

|

2014

|

z. 194, t. 1

185--194

EN

The paper reports initial results on modeling and simulating cooperation of rescue robots. Our aim is to investigate the efficiency of the "first simulate then act" paradigm for rescue operations undertaken by multiple mobile robots, assuming that information about the environment can be incomplete and partially inconsistent. to deal with ignorance and contradictions we adopt a non-standard logic in the infrrence engine. To demonstrate feasibility of our approach we present the architecture of the developed simulator and results of experiments done so far.

3

A Framework for Graded Beliefs, Goals and Intentions

Dunin-Kęplicz B., Nguyen L.A. L.A., Szałas A.

Fundamenta Informaticae

|

2010

|

Vol. 100, nr 1/4

53-76

EN

In natural language we often use graded concepts, reflecting different intensity degrees of certain features. Whenever such concepts appear in a given real-life context, they need to be appropriately expressed in its models. In this paper, we provide a framework which allows for extending the BGI model of agency by grading beliefs, goals and intentions. We concentrate on TEAMLOG [6, 7, 8, 9, 12] and provide a complexity-optimal decision method for its graded version TEAMLOGK by translating it into CPDL_reg (propositional dynamic logic with converse and "inclusion axioms" characterized by regular languages). We also develop a tableau calculus which leads to the first EXPTIME (optimal) tableau decision procedure for CPDL_reg. As CPDL_reg is suitable for expressing complex properties of graded operators, the procedure can also be used as a decision tool for other multiagent formalisms.

4

Complexity Issues in Multiagent Logics

Dziubiński M., Verbrugge R., Dunin-Kęplicz B.

Fundamenta Informaticae

|

2007

|

Vol. 75, nr 1-4

239-262

EN

Our previous research presents a methodology of cooperative problem solving for belief-desire-intention (BDI) systems, based on a complete formal theory called TeamLog. This covers both a static part, defining individual, bilateral and collective agent attitudes, and a dynamic part, describing system reconfiguration in a dynamic, unpredictable environment. In this paper, we investigate the complexity of the satisfiability problem of the static part of TeamLog, focusing on individual and collective attitudes up to collective intention. Our logics for teamwork are squarely multi-modal, in the sense that different operators are combined and may interfere. One might expect that such a combination is much more complex than the basic multi-agent logic with one operator, but in fact we show that it is not the case: the individual part of TeamLog is PSPACE-complete, just like the single modality case. The full system, modelling a subtle interplay between individual and group attitudes, turns out to be EXPTIME-complete, and remains so even when propositional dynamic logic is added to it. Additionally we make a first step towards restricting the language of TeamLog in order to reduce its computational complexity. We study formulas with bounded modal depth and show that in case of the individual part of our logics, we obtain a reduction of the complexity to NPTIME-completeness. We also show that for group attitudes in TeamLog the satisfiability problem remains in EXPTIME-hard, even when modal depth is bounded by 2. We also study the combination of reducing modal depth and the number of propositional atoms. We show that in both cases this allows for checking the satisfiability in linear time.

5

A Tuning Machine for Cooperative Problem Solving

Dunin-Kęplicz B., Verbrugge R.

Fundamenta Informaticae

|

2004

|

Vol. 63, nr 2,3

283--307

EN

In this paper we aim to formally model individual, social and collective motivational attitudes in teams of agents involved in Cooperative Problem Solving. Particular attention is given to the strongest motivational attitude, collective commitment, which leads to team action. First, building on our previous work, a logical framework is sketched in which social commitments and collective intentions are formalized. Then, different versions of collective commitments are given, reflecting different aspects of Cooperative Problem Solving, and applicable in different situations. The definitions differ with respect to the aspects of teamwork of which the agents involved are aware, and the kind of awareness present within a team. In this way a kind of tuning mechanism is provided for the system developer to tune a version of collective commitment fitting the circumstances. Finally, we focus attention on a few exemplar versions of collective commitment resulting from instantiating the general tuning scheme, and sketch for which kinds of organization and application domains they are appropriate.

6

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.

7

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.