Home > Research > Publications & Outputs > Cupid

Research

Associated organisational unit

Electronic data

  • 9938-44355-1-PB

    Rights statement: Copyright c 2015, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.

    Final published version, 635 KB, PDF document

    Available under license: CC BY: Creative Commons Attribution 4.0 International License

Links

Keywords

View graph of relations

Cupid: commitments in relational algebra

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

Published

Standard

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

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

Harvard

Chopra, AK & Singh, MP 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. <http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9938>

APA

Chopra, A. K., & Singh, M. P. (2015). Cupid: commitments in relational algebra. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (pp. 2052-2059). (AAAI Conference on Artificial Intelligence). AAAI. http://www.aaai.org/ocs/index.php/AAAI/AAAI15/paper/view/9938

Vancouver

Chopra AK, Singh MP. Cupid: commitments in relational algebra. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence. AAAI. 2015. p. 2052-2059. (AAAI Conference on Artificial Intelligence).

Author

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

Bibtex

@inproceedings{0aed31585fee4e79bcd5a87327debacc,
title = "Cupid: commitments in relational algebra",
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.",
keywords = "commitments, commitment protocols, information, databases, relational algebra",
author = "Chopra, {Amit K.} and Singh, {Munindar P.}",
note = "Copyright c 2015, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved. ",
year = "2015",
language = "English",
isbn = "74810895",
series = "AAAI Conference on Artificial Intelligence",
publisher = "AAAI",
pages = "2052--2059",
booktitle = "Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence",

}

RIS

TY - GEN

T1 - Cupid

T2 - commitments in relational algebra

AU - Chopra, Amit K.

AU - Singh, Munindar P.

N1 - Copyright c 2015, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.

PY - 2015

Y1 - 2015

N2 - 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.

AB - 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.

KW - commitments

KW - commitment protocols

KW - information

KW - databases

KW - relational algebra

M3 - Conference contribution/Paper

SN - 74810895

T3 - AAAI Conference on Artificial Intelligence

SP - 2052

EP - 2059

BT - Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence

PB - AAAI

ER -