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

用XSB-Prolog证明确定性逻辑程序的可重写性失败

Proving Failure of Queries for Definite Logic Programs Using XSB-Prolog

Nikolay Pelov, Maurice Bruynooghe

摘要:

证明对确定逻辑程序的查询失败可以通过构造查询为假的程序的有限模型来完成。一阶逻辑的通用模型生成器可以用于此。最近在PLILP 98上发表的一篇论文展示了如何利用确定性程序的特性来获得更好的解决方案。有一个程序,它结合了绑架与制表,并使用元解释器的启发式控制的搜索。本文展示了如何通过直接执行XSB-Prolog系统的标准制表下,可以得到类似的结果。通过更好的智能回溯和更准确的故障分析来补偿失去控制。

英文摘要:

Proving failure of queries for definite logic programs can be done by constructing a finite model of the program in which the query is false. A general purpose model generator for first order logic can be used for this. A recent paper presented at PLILP98 shows how the peculiarities of definite programs can be exploited to obtain a better solution. There a procedure is described which combines abduction with tabulation and uses a meta-interpreter for heuristic control of the search. The current paper shows how similar results can be obtained by direct execution under the standard tabulation of the XSB-Prolog system. The loss of control is compensated for by better intelligent backtracking and more accurate failure analysis.

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

↑