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

时态推理算法的设计与实验分析

The Design and Experimental Analysis of Algorithms for Temporal Reasoning

P. vanBeek, D. W. Manchak

摘要:

许多应用程序-从计划和调度到分子生物学问题-都严重依赖于时间推理组件。在本文中,我们讨论了时间推理系统的算法的设计和实证分析的基础上,艾伦的有影响力的基于时间信息的框架。该系统的核心是用于确定时间信息是否一致的算法,并且如果是,则找到与时间信息一致的一个或多个场景。这些任务的两个重要算法是路径一致性算法和回溯算法。对于路径一致性算法,我们开发的技术,可以导致一个已经高度优化的实现高达十倍的加速。对于回溯算法,我们开发变量和值排序算法,经验表明,显着提高算法的性能。此外,我们表明,以前建议的回溯搜索问题的重新表述可以减少回溯搜索的时间和空间要求。两者合计,我们开发的技术允许一个时间推理组件来解决实际规模的问题。

英文摘要:

Many applications -- from planning and scheduling to problems in molecular biology -- rely heavily on a temporal reasoning component. In this paper, we discuss the design and empirical analysis of algorithms for a temporal reasoning system based on Allen's influential interval-based framework for representing temporal information. At the core of the system are algorithms for determining whether the temporal information is consistent, and, if so, finding one or more scenarios that are consistent with the temporal information. Two important algorithms for these tasks are a path consistency algorithm and a backtracking algorithm. For the path consistency algorithm, we develop techniques that can result in up to a ten-fold speedup over an already highly optimized implementation. For the backtracking algorithm, we develop variable and value ordering heuristics that are shown empirically to dramatically improve the performance of the algorithm. As well, we show that a previously suggested reformulation of the backtracking search problem can reduce the time and space requirements of the backtracking search. Taken together, the techniques we develop allow a temporal reasoning component to solve problems that are of practical size.

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

↑