An Algebra of Granular Temporal Relations for Qualitative Reasoning

Authors: Quentin Cohen-Solal, Maroua Bouzid, Alexandre Niveau

IJCAI 2015 | Conference PDF | Archive PDF | Plain Text | LLM Run Details

Reproducibility Variable Result LLM Response
Research Type Theoretical In this paper, we propose a qualitative formalism for representing and reasoning about time at different scales. It extends the algebra of Euzenat [2001] and overcomes its major limitations, allowing one to reason about relations between points and intervals. Our approach is more expressive than the other algebras of temporal relations: for instance, some relations are more relaxed than those in Allen s [1983] algebra, while others are stricter. In particular, it enables the modeling of imprecise, gradual, or intuitive relations, such as just before or almost meet . In addition, we give several results about how a relation changes when considered at different granularities. Finally, we provide an algorithm to compute the algebraic closure of a temporal constraint network in our formalism, which can be used to check its consistency.
Researcher Affiliation Academia Quentin Cohen-Solal and Maroua Bouzid and Alexandre Niveau GREYC-CNRS, University of Caen, France {quentin.cohen-solal, maroua.bouzid-mouaddib, alexandre.niveau}@unicaen.fr
Pseudocode Yes Algorithm 1: Computation of the algebraic closure of a granular temporal constraint network.
Open Source Code No The paper does not include any statement or link indicating that the source code for the methodology is openly available.
Open Datasets No The paper describes a theoretical formalism and an algorithm; it does not mention the use of any dataset for training or evaluation.
Dataset Splits No The paper describes a theoretical formalism and an algorithm; it does not mention the use of any dataset or specific data splits for validation or other purposes.
Hardware Specification No The paper does not provide any specific details about the hardware used for computations or experiments.
Software Dependencies No The paper does not specify any software names with version numbers or specific dependencies required to replicate the work.
Experiment Setup No The paper presents a theoretical framework and an algorithm; it does not describe any experimental setup details such as hyperparameters or system configurations.