FOUNDATION FOR INTELLIGENT PHYSICAL AGENTS

 

 

FIPA Communicative Act Library Specification

 

Document title

FIPA Communicative Act Library Specification

Document number

XC00037H

Document source

FIPA TC C

Document status

Experimental

Date of this status

2001/08/10

Supersedes

FIPA00003, FIPA00038, FIPA00039, FIPA00040, FIPA00041, FIPA00042, FIPA00043, FIPA00044, FIPA00045, FIPA00046, FIPA00047, FIPA00048, FIPA00049, FIPA00050, FIPA00051, FIPA00052, FIPA00053, FIPA00054, FIPA00055, FIPA00056, FIPA00057, FIPA00058, FIPA00059, FIPA00060

Contact

fab@fipa.org

Change history

2001/01/29

Approved for Experimental

2001/08/10

Line numbering added

 

 

 

 

 

 

 

 

© 2000 Foundation for Intelligent Physical Agents - http://www.fipa.org/

Geneva, Switzerland

Notice

Use of the technologies described in this specification may infringe patents, copyrights or other intellectual property rights of FIPA Members and non-members. Nothing in this specification should be construed as granting permission to use any of the technologies described. Anyone planning to make use of technology covered by the intellectual property rights of others should first obtain permission from the holder(s) of the rights. FIPA strongly encourages anyone implementing any part of this specification to determine first whether part(s) sought to be implemented are covered by the intellectual property of others, and, if so, to obtain appropriate licenses or other permission from the holder(s) of such intellectual property prior to implementation. This specification is subject to change without notice. Neither FIPA nor any of its Members accept any responsibility whatsoever for damages or liability, direct or consequential, which may result from the use of this specification.

Foreword

The Foundation for Intelligent Physical Agents (FIPA) is an international organization that is dedicated to promoting the industry of intelligent agents by openly developing specifications supporting interoperability among agents and agent-based applications. This occurs through open collaboration among its member organizations, which are companies and universities that are active in the field of agents. FIPA makes the results of its activities available to all interested parties and intends to contribute its results to the appropriate formal standards bodies.

The members of FIPA are individually and collectively committed to open competition in the development of agent-based applications, services and equipment. Membership in FIPA is open to any corporation and individual firm, partnership, governmental body or international organization without restriction. In particular, members are not bound to implement or use specific agent-based standards, recommendations and FIPA specifications by virtue of their participation in FIPA.

The FIPA specifications are developed through direct involvement of the FIPA membership. The status of a specification can be either Preliminary, Experimental, Standard, Deprecated or Obsolete.More detail about the process of specification may be found in the FIPA Procedures for Technical Work. A complete overview of the FIPA specifications and their current status may be found in the FIPA List of Specifications. A list of terms and abbreviations used in the FIPA specifications may be found in the FIPA Glossary.

FIPA is a non-profit association registered in Geneva, Switzerland. As of January 2000, the 56 members of FIPA represented 17countries worldwide. Further information about FIPA as an organization, membership information, FIPA specifications and upcoming meetings may be found at http://www.fipa.org/.

Contents

1     Introduction. 1

2     Overview. 2

2.1      Status of a FIPA-Compliant Communicative Act2

2.2      FIPA Communicative Act Library Maintenance. 2

2.3      Inclusion Criteria. 3

3     FIPA Communicative Acts. 4

3.1      Accept Proposal4

3.2      Agree. 5

3.3      Cancel6

3.4      Call for Proposal7

3.5      Confirm.. 8

3.6      Disconfirm.. 9

3.7      Failure. 10

3.8      Inform.. 11

3.9      Inform If12

3.10       Inform Ref13

3.11       Not Understood. 14

3.12       Propagate. 16

3.13       Propose. 18

3.14       Proxy. 19

3.15       Query If21

3.16       Query Ref22

3.17       Refuse. 23

3.18       Reject Proposal24

3.19       Request25

3.20       Request When. 26

3.21       Request Whenever27

3.22       Subscribe. 28

4     References. 29

5     Informative Annex A — Formal Basis of ACL Semantics. 30

5.1      Introduction to the Formal Model30

5.2      The Semantic Language. 31

5.2.1      Basis of the Semantic Language Formalism.. 31

5.2.2      Abbreviations. 32

5.3      Underlying Semantic Model33

5.3.1      Property 1. 33

5.3.2      Property 2. 34

5.3.3      Property 3. 34

5.3.4      Property 4. 34

5.3.5      Property 5. 34

5.3.6      Notation. 34

5.3.7      Note on the Use of Symbols in Formulae. 35

5.3.8      Supporting Definitions. 35

5.4      Primitive Communicative Acts. 35

5.4.1      The Assertive Inform.. 35

5.4.2      The Directive Request36

5.4.3      Confirming an Uncertain Proposition: Confirm.. 36

5.4.4      Contradicting Knowledge: Disconfirm.. 36

5.5      Composite Communicative Acts. 37

5.5.1      The Closed Question Case. 37

5.5.2      The Query If Act38

5.5.3      The Confirm/Disconfirm Question Act38

5.5.4      The Open Question Case. 39

5.6      Inter-Agent Communication Plans. 40


1         Introduction

This document contains specifications for structuring the FIPA Communicative Act Library (FIPA CAL) including: status of a FIPA-compliant communicative act, maintenance of the library and inclusion criteria.

 

This document is primarily concerned with defining the structure of the FIPA CAL and the requirements for a proposed communicative act to be included in the library. The elements of the library are listed in this document.

 

This document also contains the formal basis of FIPA ACL semantics in the annex for the semantic characterization of each FIPA communicative act.

 


2         Overview

This document focuses on the organization, structure and status of the FIPA Communicative Act Library, FIPA CAL and discusses the main requirements that a communicative act must satisfy in order to be FIPA-compliant.

 

The objectives of standardizing and defining a library of FIPA compliant communicative acts are:

 

·         To help ensure interoperability by providing a standard set of composite and macro communicative acts, derived from the FIPA primitive communicative acts,

 

·         To facilitate the reuse of composite and macro communicative acts, and,

 

·         To provide a well-defined process for maintaining a set of communicative acts and act labels for use in the FIPA ACL.

 

In the following, we present the basic principles of the FIPA CAL.  These principles help to guarantee that the CAL is stable, that there are public rules for the inclusion and maintenance of the CAL and that developers seeking communicative acts for their applications can use the CAL.

 

2.1        Status of a FIPA-Compliant Communicative Act

The definition of a communicative act belonging to the FIPA CAL is normative.  That is, if a given agent implements one of the acts in the FIPA CAL, then it must implement that act in accordance with the semantic definition in the FIPA CAL.  However, FIPA-compliant agents are not required to implement any of the FIPA CAL languages, except the not-understood composite act.

 

By collecting communicative act definitions in a single, publicly accessible registry, the FIPA CAL facilitates the use of standardized Communicative Acts by agents developed in different contexts. It also provides a greater incentive to developers to make any privately developed communicative acts generally available.

 

The name assigned to a proposed communicative act must uniquely identify which communicative act is used within a FIPA ACL message.  It must not conflict with any names currently in the library, and must be an English word or abbreviation that is suggestive of the semantics.  The FIPA Agent Communication Technical Committee is the initial judge of the suitability of a name.

 

FIPA is responsible for maintaining a consistent list of approved and proposed communicative act names and for making this list publicly available to FIPA members and non-members. This list is derived from the FIPA Communicative Act Library.

 

In addition to the semantic characterization and descriptive information that is required, each Communicative Act in the FIPA CAL may specify additional information, such as stability information, versioning, contact information, different support levels, etc.

 

2.2        FIPA Communicative Act Library Maintenance

The most effective way of maintaining the FIPA Communicative Act Library is through the use of the communicative acts themselves by different agent developers. This is the most direct way of discovering possible bugs, errors, inconsistencies, weaknesses, possible improvements, as well as capabilities, strengths, efficiency etc.  In order to collect feedback on the communicative acts in the library and to promote further research, FIPA encourages coordination between agent language designers, agent developers, and FIPA members.

 

FIPA will designate a Technical Committee to maintain the FIPA CAL. The FIPA CAL will be managed by this technical committee, which will be responsible for the following items:

 

·         Collecting feedback and the comments about communicative acts in the FIPA CAL. Depending on interest, the technical committee may organize more specific Working Groups. These groups would be responsible for maintaining public lists referring to projects and people who are currently working on different communicative acts.

 

·         Inviting contributions in various forms: e-mail comments, written reports, papers, technical documents, and so forth. The current email address of the technical committee is specified on the first page of this document.

 

·         All technical committee members will be notified about contributions, comments or proposed changes and should be able to access them.

 

·         The proposed updates to the FIPA CAL must be discussed and approved during an official FIPA meeting, in order that the FIPA community may be involved with and informed of all of the FIPA approved communicative acts in the library

 

·         In the future, FIPA intends to supply templates (publicly accessible from the FIPA web site) in order to facilitate submission of candidate communicative acts to the FIPA CAL, and to ensure that agent language developers understand and can easily satisfy the requirements for the submission of a new communicative act to the FIPA CAL.

 

2.3        Inclusion Criteria

In order to populate the FIPA CAL, it is necessary to set some fundamental guidelines for the selection of specific communicative acts.

 

The minimal criteria that must be satisfied for a communicative act to be included in the FIPA CAL are:

 

·         A summary of the candidate act's semantic force and content type are required.

 

·         A detailed natural language description of the act and its consequences are required.

 

·         A formal model, written in SL, of the act's semantics, its formal preconditions, and its rational effects is required.

 

·         Examples of the usage of the new communicative act are required.

 

·         Substantial and clear documentation must be provided. This means that the proposal must be already well structured. FIPA members are in no way responsible for translating submitted communicative acts into an acceptable form.  See the form of the acts in the library for a sample.

 

·         The utility of such a new communicative act should be made clear.  In particular, it should be clear that the need it solves is reasonably general, and that this need would be cumbersome to meet by combining existing communicative acts.

 

FIPA does not enforce the use of any particular communicative act, except for the case of not-understood, and those acts which are required to meet the agent management needs of the agent.


3         FIPA Communicative Acts

3.1        Accept Proposal

Summary

The action of accepting a previously submitted proposal to perform an action.

Message Content

A tuple consisting of an action expression denoting the action to be done, and a proposition giving the conditions of the agreement.

Description

Accept-proposal is a general-purpose acceptance of a proposal that was previously submitted (typically through a proposeact). The agent sending the acceptance informs the receiver that it intends that (at some point in the future) the receiving agent will perform the action, once the given precondition is, or becomes, true.

 

The proposition given as part of the acceptance indicates the preconditions that the agent is attaching to the acceptance. A typical use of this is to finalize the details of a deal in some protocol. For example, a previous offer to "hold a meeting anytime on Tuesday" might be accepted with an additional condition that the time of the meeting is 11.00.

 

Note for future extension: an agent may intend that an action become done without necessarily intending the precondition. For example, during negotiation about a given task, the negotiating parties may not unequivocally intend their opening bids: agent a may bid a price p as a precondition, but be prepared to accept price p'.

Formal Model

<i, accept-proposal (j, <j, act>, f))> º

  <i, inform (j, Ii Done (<j, act>, f))>

    FP: BiaÙØBi (BifjaÚ Uifja)

    RE: Bja

           

Where:

 

a = Ii Done (<j, act>, f)

Example

Agent i informs j that it accepts an offer from j to stream a given multimedia title to channel 19 when the customer is ready. Agent i will inform j of this fact when appropriate.

           

(accept-proposal

  :sender (agent-identifier :name i)

  :receiver (set (agent-identifier :name j))

  :in-reply-to bid089

  :content

    ((action (agent-identifier :name j)

      (stream-content movie1234 19))

     (B (agent-identifier :name j)

      (ready customer78)))

  :language FIPA-SL)

 


3.2        Agree

Summary

The action of agreeing to perform some action, possibly in the future.

Message Content

A tuple, consisting of an action expression denoting the action to be done, and a proposition giving the conditions of the agreement.

Description

Agree is a general-purpose agreement to a previously submitted request to perform some action. The agent sending the agreement informs the receiver that it does intend to perform the action, but not until the given precondition is true.

 

The proposition given as part of the agree act indicates the qualifiers, if any, that the agent is attaching to the agreement. This might be used, for example, to inform the receiver when the agent will execute the action which it is agreeing to perform.

 

Pragmatic note: The precondition on the action being agreed to can include the perlocutionary effect of some other CA, such as an inform act. When the recipient of the agreement (for example, a contract manager) wants the agreed action to be performed, it should then bring about the precondition by performing the necessary CA. This mechanism can be used to ensure that the contractor defers performing the action until the manager is ready for the action to be done.

Formal Model

<i, agree (j, <i, act>, f))> º

  <i, inform (j, Ii Done (<i, act>, f))>

    FP: Bi aÙØBi (Bifj aÚ Uifja)

    RE: Bja

 

Where:

a = Ii Done(<i, act>, f)

 

Note that the formal difference between the semantics of agree and the semantics of accept-proposal rests on which agent is performing the action.

Example

Agent i (a job-shop scheduler) requests j (a robot) to deliver a box to a certain location. J answers that it agrees to the request but it has low priority.

 

(request

  :sender (agent-identifier :name i)

  :receiver (set (agent-identifier :name j))

  :content

    ((action (agent-identifier :name j)

      (deliver box017 (loc 12 19))))

  :protocol fipa-request

  :language FIPA-SL

  :reply-with order567)

 

(agree

  :sender (agent-identifier :name j)

  :receiver (set (agent-identifier :name i))

  :content

    ((action (agent-identifier :name j)

      (deliver box017 (loc 12 19)))

     (priority order567 low))

  :in-reply-to order567

  :protocol fipa-request

  :language FIPA-SL)


3.3        Cancel

Summary

The action of one agent informing another agent that the first agent no longer has the intention that the second agent perform some action.

Message Content

An action expression denoting the action that is no longer intended.

Description

Cancel allows an agent i to inform another agent j that i no longer intends that j perform a previously requested action.  This is not the same as i informing j that i intends that j not perform the action or stop performing an action.  Cancel is simply used to let an agent know that another agent no longer has a particular intention.  (In order for i to stop j from performing an action, i should request that j stop that action.  Of course, nothing in the ACL semantics guarantees that j will actually stop performing the action; j is free to ignore i’s request.) Finally, note that the action that is the object of the act of cancellation should be believed by the sender to be ongoing or to be planned but not yet executed.

Formal Model

<i, cancel (j, a)> º

  <i, disconfirm (j, Ii Done (a))>

    FP: ØIi Done (a) Ù Bi (Bj Ii Done (a) Ú Uj Ii Done (a))

    RE: Bj ØIi Done (a)

 

Cancel applies to any form of requested action. Suppose an agent i has requested an agent j to perform some action a, possibly if some condition holds. This request has the effect of i informing j that i has an intention that j perform the action a. When i comes to drop its intention, it can inform j that it no longer has this intention with a disconfirm.

Example

Agent j asks i to cancel a previous request-whenever by quoting the action.

 

(cancel

  :sender (agent-identifier :name j)

  :receiver (set (agent-identifier :name i))

  :content

    ((action (agent-identifier :name j)

      (request-whenever

        :sender (agent-identifier :name j)

        :receiver (set(agent-identifier :name i))

        :content[1]

          "((action (agent-identifier :name i)

            (inform-ref

              :sender (agent-identifier :name i)

              :receiver (set (agent-identifier :name j))

              :content[2]

                \"((iota ?x

                    (=(price widget) ?x))\")

                    (> (price widget) 50))"

                    …)))

  :langage FIPA-SL

  …)

 

 


3.4        Call for Proposal

Summary

The action of calling for proposals to perform a given action.

Message Content

A tuple containing an action expression denoting the action to be done, and a referential expression defining a single-parameter proposition which gives the preconditions on the action.

Description

CFP is a general-purpose action to initiate a negotiation process by making a call for proposals to perform the given action. The actual protocol under which the negotiation process is established is known either by prior agreement, or is explicitly stated in the :protocol parameter of the message.

 

In normal usage, the agent responding to a cfp should answer with a proposition giving the value of the parameter in the original precondition expression (see the statement of cfp's rational effect). For example, the cfp might seek proposals for a journey from Frankfurt to Munich, with a condition that the mode of travel is by train. A compatible proposal in reply would be for the 10.45 express train. An incompatible proposal would be to travel by airplane.

 

Note that cfp can also be used to simply check the availability of an agent to perform some action. Also note that this formalization of cfp is restricted to the common case of proposals characterized by a single parameter (x) in the proposal expression. Other scenarios might involve multiple proposal parameters, demand curves, free-form responses, and so forth. 

Formal Model

<i, cfp (j, <j, act>, Ref x f(x))> º

  <i, query-ref (j, Ref x (Ii Done (<j, act>, f(x)) Þ

                (Ij Done (<j, act>, f(x))))>

    FP: ØBrefi(Ref xa(x)) ÙØUrefi(Ref xa(x)) Ù

                ØBi Ij Done (<j, inform-ref (i, Ref xa(x))>)

    RE: Done (<j, inform (i, Ref xa(x) = r1)> | … |

                <j, inform (i, Ref xa(x) = rk)>)

 

Where:

 

a(x) = Ii Done (<j, act>, f(x)) Þ Ij Done (<j, act>, f(x))

 

Agent i asks agent j: "What is the 'x' such that you will perform action 'act' when 'f (x)' holds?"

 

Note:  Ref xd(x) is one of the referential expressions:  ix d(x), any x d(x) or all x d(x).

 

Note: The RE of this is not a proposal by the recipient. Rather, it is the value of the proposal parameter. See the example in the definition of the propose act.

Example

Agent j asks i to submit its proposal to sell 50 boxes of plums.

 

(cfp

  :sender (agent-identifier :name j)

  :receiver (set (agent-identifier :name i))

  :content

    ((action (agent-identifier :name i)

      (sell plum 50))

     (any ?x (and (= (price plum) ?x) (< ?x 10))))

  :ontology fruit-market)

 


3.5        Confirm

Summary

The sender informs the receiver that a given proposition is true, where the receiver is known to be uncertain about the proposition.

Message Content

A proposition.

Description

The sending agent:

 

·       believes that some proposition is true,

 

·       intends that the receiving agent also comes to believe that the proposition is true, and,

 

·       believes that the receiver is uncertain of the truth of the proposition.

The first two properties defined above are straightforward: the sending agent is sincere[3], and has (somehow) generated the intention that the receiver should know the proposition (perhaps it has been asked). The last pre-condition determines when the agent should use confirm vs. inform vs. disconfirm: confirm is used precisely when the other agent is already known to be uncertain about the proposition (rather than uncertain about the negation of the proposition).

From the receiver's viewpoint, receiving a confirm message entitles it to believe that:

 

·       the sender believes the proposition that is the content of the message, and,

 

·       the sender wishes the receiver to believe that proposition also.

 

Whether or not the receiver does, indeed, change its mental attitude to one of belief in the proposition will be a function of the receiver's trust in the sincerity and reliability of the sender.

Formal Model

<i, confirm (j, f)>

  FP: BifÙ BiUjf

  RE: Bjf

Examples

Agent i confirms to agent j that it is, in fact, true that it is snowing today.

 

(confirm

  :sender (agent-identifier :name i)

  :receiver (set (agent-identifier :name j))

  :content

    "weather (today, snowing)"

  :language Prolog)

 


3.6        Disconfirm

Summary

The sender informs the receiver that a given proposition is false, where the receiver is known to believe, or believe it likely that, the proposition is true.

Message Content

A proposition.

Description

The disconfirm act is used when the agent wishes to alter the known mental attitude of another agent.

 

The sending agent:

 

·       believes that some proposition is false,

 

·       intends that the receiving agent also comes to believe that the proposition is false, and,

 

·       believes that the receiver either believes the proposition, or is uncertain of the proposition.

 

The first two properties defined above are straightforward: the sending agent is sincere3, and has (somehow) generated the intention that the receiver should know the proposition (perhaps it has been asked). The last pre-condition determines when the agent should use confirm vs. inform vs. disconfirm: disconfirm is used precisely when the other agent is already known to believe the proposition or to be uncertain about it.

 

From the receiver's viewpoint, receiving a disconfirm message entitles it to believe that:

 

·       the sender believes that the proposition that is the content of the message is false, and,

 

·       the sender wishes the receiver to believe the negated proposition also.

 

Whether or not the receiver does, indeed, change its mental attitude to one of disbelief in the proposition will be a function of the receiver's trust in the sincerity and reliability of the sender.

Formal Model

<i, disconfirm (j, f)>

  FP: BiØfÙ Bi(UjfÚ Bjf)

  RE: BjØf

Example

Agent i, believing that agent j thinks that a shark is a mammal, attempts to change j's belief.

 

(disconfirm

  :sender (agent-identifier :name i)

  :receiver (set (agent-identifier :name j))

  :content

    ((mammal shark))

  :language FIPA-SL)

 

 


3.7        Failure

Summary

The action of telling another agent that an action was attempted but the attempt failed.

Message Content

A tuple, consisting of an action expression and a proposition giving the reason for the failure.

Description

The failure act is an abbreviation for informing that an act was considered feasible by the sender, but was not completed for some given reason.

 

The agent receiving a failure act is entitled to believe that:

 

·         the action has not been done, and,

 

·         the action is (or, at the time the agent attempted to perform the action, was) feasible

 

The (causal) reason for the failure is represented by the proposition, which is the second element of the message content tuple. It may be the constant true. Often it is the case that there is little either agent can do to further the attempt to perform the action.

Formal Model

<i, failure (j, a, f)> º

  <i, inform (j, ($e) Single (e) Ù Done (e, Feasible (a) Ù

             Ii Done (a)) ÙfÙØDone (a) ÙØIi Done (a))>

    FP: Bi aÙØBi (Bifj aÚ Uifj a)

    RE: Bj a

 

Where:

 

a = ($e) Single (e) Ù Done (e, Feasible (a) Ù Ii Done (a)) ÙfÙ

                     ØDone (a) ÙØIi Done (a)

 

Agent i informs agent j that, in the past, i had the intention to do action a and a was feasible. i performed the action of attempting to do a (that is, the action/event e is the attempt to do a), but now a has not been done and i no longer has the intention to do a, and f