arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv cs/0412041cs.PLcs.AIcs.LO
收藏

一个高效灵活的不动点计算引擎

An Efficient and Flexible Engine for Computing Fixed Points

Hai-Feng Guo, Gopal Gupta

摘要:

一个高效、灵活的不动点计算引擎对于许多实际应用至关重要。在本文中,我们首先提出了一个目标导向的不动点计算策略的逻辑程序设计范式。该策略采用表格解析(或记忆解析)来模拟高效的半朴素自底向上计算。它的主要思想是动态地识别和记录那些将导致递归变量调用的子句,然后重复地增量地应用这些替代方案,直到达到固定点。其次,有许多情况下,一个不动点包含大量甚至无限多个解。在这些情况下,固定点计算引擎可能不够高效或根本不可行。我们提出了一个模式声明计划,提供的能力,以减少一个不动点从一个大的解决方案集到一个首选的小的,或从一个不可行的无限集到一个有限的。模式声明方案可以被描述为在原始固定点上的元级操作。我们证明了模式声明方案的正确性。第三,模式声明方案为动态规划提供了一种新的声明方法,动态规划通常用于求解最优化问题。不需要递归地定义最优解的值,相反,定义一般解就足够了。最优值以及其相应的具体解决方案,可以推导出隐式和自动使用模式定向定点计算引擎。最后,该定点计算引擎已在商业Prolog系统中成功实现。实验结果表明,模式声明提高了解决动态规划问题的时间和空间性能。

英文摘要:

An efficient and flexible engine for computing fixed points is critical for many practical applications. In this paper, we firstly present a goal-directed fixed point computation strategy in the logic programming paradigm. The strategy adopts a tabled resolution (or memorized resolution) to mimic the efficient semi-naive bottom-up computation. Its main idea is to dynamically identify and record those clauses that will lead to recursive variant calls, and then repetitively apply those alternatives incrementally until the fixed point is reached. Secondly, there are many situations in which a fixed point contains a large number or even infinite number of solutions. In these cases, a fixed point computation engine may not be efficient enough or feasible at all. We present a mode-declaration scheme which provides the capabilities to reduce a fixed point from a big solution set to a preferred small one, or from an infeasible infinite set to a finite one. The mode declaration scheme can be characterized as a meta-level operation over the original fixed point. We show the correctness of the mode declaration scheme. Thirdly, the mode-declaration scheme provides a new declarative method for dynamic programming, which is typically used for solving optimization problems. There is no need to define the value of an optimal solution recursively, instead, defining a general solution suffices. The optimal value as well as its corresponding concrete solution can be derived implicitly and automatically using a mode-directed fixed point computation engine. Finally, this fixed point computation engine has been successfully implemented in a commercial Prolog system. Experimental results are shown to indicate that the mode declaration improves both time and space performances in solving dynamic programming problems.

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

↑