Home > Research > Publications & Outputs > Cupid

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, 634 KB, PDF document

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

Links

View graph of relations

Cupid: commitments in relational algebra

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paper

Published
Publication date2015
Host publicationProceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence
PublisherAAAI
Pages2052-2059
Number of pages8
Original languageEnglish

Publication series

NameAAAI Conference on Artificial Intelligence
PublisherAAAI
ISSN (Print)2159-5399
ISSN (Electronic)2374-3468

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.

Bibliographic note

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