Nonmonotonic Commitment Machines

Show full item record

Title: Nonmonotonic Commitment Machines
Author: Chopra, Amit Khushwant
Advisors: Dr Munindar P. Singh, Committee Chair
Dr. Rada Chirkova, Committee Member
Dr. R. Michael Young, Committee Member
Abstract: Protocols in open and dynamic multiagent systems cannot be modeled via formalisms such as finite state machines (FSMs). FSMs though formal, lack content, that is, a protocol-level semantics, which leads to rigidity in protocols. We propose formalism called Nonmonotonic Commitment Machines (NCMs) for representing protocols. An NCM gives a commitment-based semantics to actions and states in a protocol. 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. For applications that need efficient execution, we show how to compile an NCM into an FSM and prove the compilation to be sound and complete.
Date: 2003-11-07
Degree: MS
Discipline: Computer Science

Files in this item

Files Size Format View
etd.pdf 215.9Kb PDF View/Open

This item appears in the following Collection(s)

Show full item record