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

一种通用的合格逻辑程序设计方案

A Generic Scheme for Qualified Logic Programming

Mario Rodríguez-Artalejo, Carlos A. Romero-Díaz

摘要:

逻辑程序设计中的不确定性已经研究了大约25年,发表了关于语义和不同应用的各种方法的论文。这份报告的目的是作为第一步的调查合格的计算约束功能逻辑编程,包括不确定的计算作为一个特殊的情况。我们修改了早期的建议,即范埃姆登的定量逻辑编程,我们在两个方面改进它。首先,我们将van Emden的QLP推广到由任意给定的限定域D参数化的一般模式QLP(D),限定域D必须是满足某些自然公理的格。我们为D提供了几个有趣的实例,其中之一对应于van Emden的QLP。其次,我们推广范埃姆登的结果提供更强的,关于语义和目标求解。我们提出了D上的限定SLD分解,这是QLP(D)的一个可靠的和强完整的目标求解过程,它适用于开放目标,并且可以在任何能够处理D上的限定约束的约束域CD上使用CLP技术有效地实现。我们已经在CFLP系统TOY上开发了QLP(D)方案(包括van Emden的QLP)的一些实例的原型实现。

英文摘要:

Uncertainty in Logic Programming has been investigated since about 25 years, publishing papers dealing with various approaches to semantics and different applications. This report is intended as a first step towards the investigation of qualified computations in Constraint Functional Logic Programming, including uncertain computations as a particular case. We revise an early proposal, namely van Emden's Quantitative Logic Programming, and we improve it in two ways. Firstly, we generalize van Emden's QLP to a generic scheme QLP(D) parameterized by any given Qualification Domain D, which must be a lattice satisfying certain natural axioms. We present several interesting instances for D, one of which corresponds to van Emden's QLP. Secondly, we generalize van Emden's results by providing stronger ones, concerning both semantics and goal solving. We present Qualified SLD Resolution over D, a sound and strongly complete goal solving procedure for QLP(D), which is applicable to open goals and can be efficiently implemented using CLP technology over any constraint domain CD able to deal with qualification constraints over D. We have developed a prototype implementation of some instances of the QLP(D) scheme (including van Emden's QLP) on top of the CFLP system TOY.

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

↑