多尺度 Allen 时序推理的最大可处理子类研究
The Largest Tractable Subclass of Multi-Scale Allen Temporal Reasoning
AI 导读
arXiv 论文提出一种面向多尺度区间时序推理的新模型,证明其构成完整的推理框架并具有其他有趣性质。研究还识别出该模型以及另一个完整模型在定性尺度情境下的最大可处理子代数,后者性质较弱,其结果可从新模型迁移推导得到。
正文 · 原文
Abstract:In this paper, we propose a novel model for temporal reasoning over multi-scale intervals. We show that this model yields a complete reasoning framework and exhibits other particularly interesting properties. Furthermore, we identify the maximal tractable subalgebra for this model, as well as for the other complete model, in the qualitative scales context, which exhibits weaker properties but whose results can be derived by transfer from our new model.
| Subjects: | Artificial Intelligence (cs.AI) |
| Cite as: | arXiv:2611.24498 [cs.AI] |
| (or arXiv:2611.24498v1 [cs.AI] for this version) | |
| https://doi.org/10.48550/arXiv.2611.24498 arXiv-issued DOI via DataCite (pending registration) |
Submission history
From: Quentin Cohen-Solal [view email]
[v1]
Wed, 18 Nov 2026 14:26:04 UTC (50 KB)
来源:arXiv cs.AI · arxiv.org