Cupid:commitments in relational algebra

Chopra, Amit K. and Singh, Munindar P. (2015) Cupid:commitments in relational algebra. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence. AAAI Conference on Artificial Intelligence . AAAI, pp. 2052-2059.

[img]
Preview
PDF (9938-44355-1-PB)
9938_44355_1_PB.pdf - Published Version
Available under License Creative Commons Attribution.

Download (650kB)

Abstract

We propose Cupid, a language for specifying commitments that supports their information-centric aspects, and offers crucial benefits. One, Cupid is first-order, enabling a systematic treatment of commitment instances. Two, Cupid supports features needed for real-world scenarios such as deadlines, nested commitments, and complex event expressions for capturing the lifecycle of commitment instances. Three, Cupid maps to relational database queries and thus provides a set-based semantics for retrieving commitment instances in states such as being violated, discharged, and so on. We prove that Cupid queries are safe. Four, to aid commitment modelers, we propose the notion of well-identified commitments, and finitely violable and finitely expirable commitments. We give syntactic restrictions for obtaining such commitments.

Item Type:
Contribution in Book/Report/Proceedings
Additional Information:
Copyright c 2015, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
Subjects:
ID Code:
72757
Deposited By:
Deposited On:
28 Jan 2015 16:43
Refereed?:
Yes
Published?:
Published
Last Modified:
29 Oct 2020 10:19