We have over 12,000 students, from over 100 countries, within one of the safest campuses in the UK


97% of Lancaster students go into work or further study within six months of graduating

Home > Research > Publications & Outputs > Nonmonotonic commitment machines
View graph of relations

« Back

Nonmonotonic commitment machines

Research output: Contribution in Book/Report/ProceedingsPaper


Publication date2004
Host publicationAdvances in Agent Communication: International Workshop on Agent Communication Languages, ACL 2003, Melbourne, Australia, July 14, 2003. Revised and Invited Papers
EditorsFrank Dignum
Place of publicationBerlin
Number of pages18
ISBN (Electronic)978-3-540-24608-4
ISBN (Print)978-3-540-20769-6
<mark>Original language</mark>English

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743


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.