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

逻辑程序设计中提升引理的推广

A Generalization of the Lifting Lemma for Logic Programming

Etienne Payet, Fred Mesnard

摘要:

自从J. A. Robinson关于归结的证明,文献中提出了许多提升引理来简化归结完备性的证明。在逻辑程序设计框架中,它们也可以帮助检测一些无限推导,同时证明SLD-分辨率下的目标。在本文中,我们首先推广了一个版本的提升引理,通过扩展的关系“比”,使它只考虑一些参数的原子。其他参数,我们称之为中性参数,被忽略。然后,我们提出了两个句法条件的增加权力,从纯粹的检查一个逻辑程序的文本中识别中性论点。

英文摘要:

Since the seminal work of J. A. Robinson on resolution, many lifting lemmas for simplifying proofs of completeness of resolution have been proposed in the literature. In the logic programming framework, they may also help to detect some infinite derivations while proving goals under the SLD-resolution. In this paper, we first generalize a version of the lifting lemma, by extending the relation "is more general than" so that it takes into account only some arguments of the atoms. The other arguments, which we call neutral arguments, are disregarded. Then we propose two syntactic conditions of increasing power for identifying neutral arguments from mere inspection of the text of a logic program.

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

↑