Nonmonotonic Commitment Machines

Abstract

Protocols for multiagent interaction need to be flexible because of the open and dynamic nature of multiagent systems. Such protocols cannot be modeled adequately via finite state machines (FSMs) as FSM representations lead to rigid protocols. We propose a commitment-based formalism called Nonmonotonic Commitment Machines (NCMs) for representing multiagent interaction protocols. In this approach, we give semantics to states and actions in a protocol in terms of commitments. Protocols represented as NCMs afford the agent flexibility in interactions with other agents. In particular, situations in protocols when nonmonotonic reasoning is required can be efficiently represented in NCMs.

DOI: 10.1007/978-3-540-24608-4_11

Extracted Key Phrases

3 Figures and Tables

Statistics

051015'04'06'08'10'12'14'16
Citations per Year

63 Citations

Semantic Scholar estimates that this publication has 63 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Chopra2003NonmonotonicCM, title={Nonmonotonic Commitment Machines}, author={Amit K. Chopra and Munindar P. Singh}, booktitle={Workshop on Agent Communication Languages}, year={2003} }