Cupid: Commitments in Relational Algebra
Authors: Amit Chopra, Munindar Singh
AAAI 2015 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | 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 setbased 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. |
| Researcher Affiliation | Academia | Amit K. Chopra Lancaster University Lancaster LA1 4WA, United Kingdom a.chopra1@lancaster.ac.uk Munindar P. Singh North Carolina State University Raleigh, NC 27695-8206, USA singh@ncsu.edu |
| Pseudocode | No | The paper provides syntax definitions (Table 1) and semantic postulates (D1-D20) using relational algebra, but does not present structured pseudocode or algorithm blocks. |
| Open Source Code | No | The paper mentions 'Yang’s [2014] tool' and provides a URL for it, but this is a third-party relational algebra interpreter, not the authors' own implementation code. It also states that producing a compiler for Cupid specifications is 'ongoing', implying their own code is not yet available. |
| Open Datasets | No | The paper focuses on theoretical contributions and formalization; it does not describe experiments involving training datasets. |
| Dataset Splits | No | The paper focuses on theoretical contributions and formalization; it does not describe experiments involving validation datasets. |
| Hardware Specification | No | The paper is theoretical and does not describe empirical experiments; therefore, no hardware specifications are mentioned for running experiments. |
| Software Dependencies | No | The paper mentions 'relational database queries' and refers to 'Yang’s [2014] tool: A relational algebra interpreter', providing a URL for it. However, it does not list specific version numbers for this or any other software dependencies needed to replicate its theoretical framework or results. |
| Experiment Setup | No | The paper is theoretical and does not describe empirical experiments; therefore, there are no specific experimental setup details (hyperparameters, training configurations) provided. |