Reasoning on Interval and Point-based Disjunctive Metric Constraints in Temporal Contexts
Reasoning on Interval and Point-based Disjunctive Metric Constraints in Temporal Contexts
复制标题
时间上下文中区间和基于点的析取度量约束的推理
DOI：
--
复制
发表时间：
2000
影响因子：
5
通讯作者：
F. Barber
中科院分区：
文献类型：
--
作者：
F. Barber
我们介绍了一个时间模型的推理时间上下文的间隔和时间点的析取度量约束。该时态模型由一个带标号的时态代数及其推理算法组成。标记的时间代数定义了标记的析取度量基于点的约束，其中每个输入析取约束中的每个析取与标签单义地相关联。推理算法管理标记的约束、关联的标签列表和相互不一致的析取集。这些算法保证一致性，并获得最小的网络。此外，约束可以组织在一个层次的替代时间上下文。因此，我们可以推理区间和点上的上下文相关的析取度量约束。此外，该模型能够表示非二进制约束，这样就可以处理约束中的逻辑依赖关系。推理算法的计算成本是指数根据潜在的问题的复杂性，虽然提出了一些改进。
We introduce a temporal model for reasoning on disjunctive metric constraints on intervals and time points in temporal contexts. This temporal model is composed of a labeled temporal algebra and its reasoning algorithms. The labeled temporal algebra defines labeled disjunctive metric point-based constraints, where each disjunct in each input disjunctive constraint is univocally associated to a label. Reasoning algorithms manage labeled constraints, associated label lists, and sets of mutually inconsistent disjuncts. These algorithms guarantee consistency and obtain a minimal network. Additionally, constraints can be organized in a hierarchy of alternative temporal contexts. Therefore, we can reason on context-dependent disjunctive metric constraints on intervals and points. Moreover, the model is able to represent non-binary constraints, such that logical dependencies on disjuncts in constraints can be handled. The computational cost of reasoning algorithms is exponential in accordance with the underlying problem complexity, although some improvements are proposed.