Standard
Nonmonotonic commitment machines. /
Chopra, Amit; Singh, Munindar P.
Advances in Agent Communication: International Workshop on Agent Communication Languages, ACL 2003, Melbourne, Australia, July 14, 2003. Revised and Invited Papers. ed. / Frank Dignum. Berlin: Springer, 2004. p. 183-200 (Lecture Notes in Computer Science; Vol. 2922).
Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review
Harvard
Chopra, A & Singh, MP 2004,
Nonmonotonic commitment machines. in F Dignum (ed.),
Advances in Agent Communication: International Workshop on Agent Communication Languages, ACL 2003, Melbourne, Australia, July 14, 2003. Revised and Invited Papers. Lecture Notes in Computer Science, vol. 2922, Springer, Berlin, pp. 183-200.
https://doi.org/10.1007/978-3-540-24608-4_11
APA
Vancouver
Chopra A, Singh MP.
Nonmonotonic commitment machines. In Dignum F, editor, Advances in Agent Communication: International Workshop on Agent Communication Languages, ACL 2003, Melbourne, Australia, July 14, 2003. Revised and Invited Papers. Berlin: Springer. 2004. p. 183-200. (Lecture Notes in Computer Science). doi: 10.1007/978-3-540-24608-4_11
Author
Chopra, Amit ; Singh, Munindar P. /
Nonmonotonic commitment machines. Advances in Agent Communication: International Workshop on Agent Communication Languages, ACL 2003, Melbourne, Australia, July 14, 2003. Revised and Invited Papers. editor / Frank Dignum. Berlin : Springer, 2004. pp. 183-200 (Lecture Notes in Computer Science).
Bibtex
@inproceedings{635be36e0cbd46caaf12949c576c57bf,
title = "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.",
author = "Amit Chopra and Singh, {Munindar P.}",
year = "2004",
doi = "10.1007/978-3-540-24608-4_11",
language = "English",
isbn = "978-3-540-20769-6",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "183--200",
editor = "Frank Dignum",
booktitle = "Advances in Agent Communication",
}
RIS
TY - GEN
T1 - Nonmonotonic commitment machines
AU - Chopra, Amit
AU - Singh, Munindar P.
PY - 2004
Y1 - 2004
N2 - 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.
AB - 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.
U2 - 10.1007/978-3-540-24608-4_11
DO - 10.1007/978-3-540-24608-4_11
M3 - Conference contribution/Paper
SN - 978-3-540-20769-6
T3 - Lecture Notes in Computer Science
SP - 183
EP - 200
BT - Advances in Agent Communication
A2 - Dignum, Frank
PB - Springer
CY - Berlin
ER -