"... In PAGE 8: ... In [23] we argued that obligations play an important role in accounting for many of the interactions in dialog. For example, Table1 shows the obligations resulting from the performance of speech acts. Obligations do not replace the plan-based model of speech acts (e.... ..."

"... In PAGE 4: ... We use a simple forward chaining tech- nique to introduce obligations. Some obligation rules based on the performance of conversation acts are summarized in Table1 . When an agent performs a promise to perform an action, or performs an acceptance of a suggestion or request by another agent to perform an action, the agent obliges itself to achieve the action in question.... In PAGE 7: ... The TRAINS-93 script includes phases for identifying a domain goal, devel- oping a shared plan to meet this goal, and executing the plan in the TRAINS domain. The system also maintains structures of obligations which have arisen according to the rules in Table1 . Also, a set of in- tended conversation acts is maintained, which the sys- tem will try to perform (by sending to the NL Gen- erator, for output to the user), when it gets an op- portunity.... ..."

"... In PAGE 3: ... We use a simple forward chaining technique to introduce obligations. Some obligation rules based on the performance of con- versation acts are summarized in Table1 . When an agent performs a promise to perform an action, or performs an acceptance of a suggestion or request by another agent to perform an action, the agent obliges itself to achieve the ac- tion in question.... ..."

"... In PAGE 3: ... Let us introduce a simple example to illustrate Ponder obligation policies. In Table1 the P1 policy states that the Buyer agent is obliged by the System component to migrate to a different node, called G1, when the current node becomes overloaded. The migration action is triggered by the CPU usage exceeding 90%, and the Buyer agent is forced to move to G1 and there to perform the run() method, if G1 is reachable.... ..."

"... In PAGE 4: ... Let us introduce a simple example to illustrate Ponder obligation policies. In Table1 the P1 policy states that the agent called Manager is obliged to migrate to a dif- ferent node, called G1, when the current node becomes overloaded. The migration action is triggered by a CPU usage exceeding 90%, thus forcing the Manager agent to move to G1 and to perform the run() method there, if G1 is reachable.... ..."

"... In PAGE 6: ... The size of the generated programs ranges from 43 1 to 1157 lines of commented C-code, includ- ing the annotations. Table2 in Section 4 gives a more detailed breakdown. The first two examples are AUTOFILTER specifications.... In PAGE 9: ... Control The simplifications are performed by a small but reasonably efficient rewrite engine implemented in Prolog (cf. Table2 for runtime information). This engine does not support full AC-rewriting but flattens and orders the arguments of AC-operators.... In PAGE 10: ... - 4 Empirical Results 4.1 Generating and Simplifying Obligations Table2 summarizes the results of generating the different versions of the safety obligations. For each of the example specifications, it lists the size of the generated programs (without annota- tions), the applicable safety policies, the size of the generated annotations (before propagation), and then, for each simplifier, the elapsed time T and the number N of generated obligations.... ..."

"... In PAGE 27: ... It is not meaningful to associate obligations with the remaining protocol ac- tions; therefore, we do not need to update the specification of permitted claims, concessions, retractions, denials or objections. Table4 presents the conditions in which a main protocol action is permitted or obligatory. Clearly, different... ..."

"... In PAGE 8: ... The size of the generated programs ranges from 431 to 1157 lines of commented C-code, in- cluding the annotations. Table3 in Section 4 gives a more detailed breakdown. The first two examples are AUTOFILTER specifications.... In PAGE 11: ... T; T8;) Tprop Teval Tarray Tarray Tpolicy simplification N/A 3 17 42 42 2 61 normalization 8 8 8 8 8 8 8 clean-up N/A N/A N/A N/A 31 3 31 Control The simplifications are performed by a small but reasonably efficient rewrite en- gine implemented in Prolog (cf. Table3 for runtime information). This engine does not sup- port full AC-rewriting but flattens and orders the arguments of AC-operators.... In PAGE 13: ...1. Generating and Simplifying Obligations Table3 summarizes the results of generating the different versions of the safety obligations. For each of the example specifications, it lists the size jP j of the generated programs (with- out annotations), the applicable safety policies, the size j A j of the generated annotations, and then, for each simplifier, the number N of generated obligations and the elapsed time T.... ..."