Commitment Machines

We develop an approach in which we model communication protocols via commitment machines. Commitment machines supply a content to protocol states and actions in terms of the social commitments of the participants. The content can be reasoned about by the agents thereby enabling flexible execution of the given protocol. We provide reasoning rules to capture the evolution of commitments through the agents’ actions. Because of its representation of content and its operational rules, a commitment machine effectively encodes a systematically enhanced version of the original protocol, which allows the original sequences of actions as well as other legal moves to accommodate exceptions and opportunities. We show how a commitment machine can be compiled into a finite state machine for efficient execution, and prove soundness and completeness of our compilation procedure.

• Type: Conference
• Year: 2001
• Where: ATAL
• Authors: Pinar Yolum, Munindar P. Singh
• Keywords: ATAL 2001, Commitment Machine, Intelligent Agents, Social Commitments, flexible Execution