Abstract
AbstractThis paper investigates the use of high-level action languages for representing and reasoning about commitments in multi-agent domains. We introduce the language \({\cal L}^{mt}\), an extension of the language \(\cal L\), with new features motivated by the problem of representing and reasoning about commitments. The paper demonstrates how features and properties of commitments can be described in this action language. We show how \({\cal L}^{mt}\) can handle both simple commitment actions as well as complex commitment protocols. Furthermore, the semantics of \({\cal L}^{mt}\) provides a uniform solution to different problems in reasoning about commitments such as the problem of (i) verifying whether an agent fails (or succeeds) to deliver on its commitments; (ii) identifying pending commitments; and (iii) suggesting ways to satisfy pending commitments.KeywordsTransition FunctionMultiagent SystemExtended StateAction LanguageTrigger StatementThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
