arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.07711cs.AI
收藏

拓扑信息时间序列的易处理片段

Tractable Fragments of Temporal Sequences of Topological Information

LAMSADE(拉马萨德实验室);Université Paris-Dauphine(巴黎多芬大学);PSL(巴黎文理研究大学);CNRS(法国国家科学研究中心)

Quentin Cohen-Solal

摘要:

在本文中,我们专注于定性的时间序列的拓扑信息。我们首先考虑的上下文的拓扑时间序列的长度大于3描述的区域在连续的时间点的演变。我们表明,没有笛卡尔子类包含所有的基本关系和泛关系的代数闭包决定满足性。然而,我们确定了一些易处理的子类,通过放弃包含非切的真部关系和不包含切的真部关系。然后,我们形式化的时间序列的替代语义。我们把自己放在拓扑时间序列的上下文中,描述了时间分区上区域的演变(即时刻和间隔的交替)。在这种情况下,我们确定大的易处理的片段。

英文摘要:

In this paper, we focus on qualitative temporal sequences of topological information. We firstly consider the context of topological temporal sequences of length greater than 3 describing the evolution of regions at consecutive time points. We show that there is no Cartesian subclass containing all the basic relations and the universal relation for which the algebraic closure decides satisfiability. However, we identify some tractable subclasses, by giving up the relations containing the non-tangential proper part relation and not containing the tangential proper part relation. We then formalize an alternative semantics for temporal sequences. We place ourselves in the context of the topological temporal sequences describing the evolution of regions on a partition of time (i.e. an alternation of instants and intervals). In this context, we identify large tractable fragments.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑