arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2103.01911cs.LOcs.PL
收藏

不带发生检查的SLD解决方案,示例

SLD-resolution without occur-check, an example

Włodzimierz Drabent

摘要:

本文证明了对于某个确定子句逻辑程序,不需要与选择规则无关的出现检查。首先证明了该程序是无发生检查的。然后,我们考虑一个更一般的类的查询,根据该程序是不发生检查免费的,但我们表明,它将正确执行Prolog下没有发生检查。本报告的主要结果表明,对于标准非确定性统一算法的单次运行不会因发生检查而失败的情况,可以跳过发生检查。通常的方法是基于NSTO(不受发生检查)的概念,它考虑了所有的运行。为了公式化结果,有必要引入一个没有发生检查的“统一”算法的抽象。

英文摘要:

We prove that the occur-check is not needed for a certain definite clause logic program, independently from the selection rule. First we prove that the program is occur-check free. Then we consider a more general class of queries, under which the program is not occur-check free; however we show that it will be correctly executed under Prolog without occur-check. The main result of this report states that the occur-check may be skipped for the cases in which a single run of a standard nondeterministic unification algorithm does not fail due to the occur-check. The usual approaches are based on the notion of NSTO (not subject to occur-check), which considers all the runs. To formulate the result, it was necessary to introduce an abstraction of a "unification" algorithm without the occur-check.

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

↑