基于转换的CLP的限定邻近实现
A Transformation-based Implementation for CLP with Qualification and Proximity
摘要:
在过去的几十年里,逻辑编程中的不确定性得到了广泛的研究,导致了经典LP范式的多种扩展。然而,很少有这些被设计为扩展的完善和强大的CLP计划约束逻辑编程。在以前的工作中,我们提出了SQCLP({ \em接近为基础的合格的约束逻辑编程})计划作为一个相当有表现力的扩展CLP与支持资格值和接近关系的概括的不确定性值和相似性关系,分别。在本文中,我们提供了一个转换技术转换成语义等价的CLP程序和目标,SQCLP计划的一些特别有用的实例和一个实际的基于Prolog的实现SQCLP程序和目标。我们还说明,通过显示一些简单的-和工作-的例子,原型如何可以有效地用作解决问题的工具,资格值和邻近关系发挥了关键作用。SQCLP的预期用途包括灵活的信息检索应用程序。
英文摘要:
Uncertainty in logic programming has been widely investigated in the last decades, leading to multiple extensions of the classical LP paradigm. However, few of these are designed as extensions of the well-established and powerful CLP scheme for Constraint Logic Programming. In a previous work we have proposed the SQCLP ({\em proximity-based qualified constraint logic programming}) scheme as a quite expressive extension of CLP with support for qualification values and proximity relations as generalizations of uncertainty values and similarity relations, respectively. In this paper we provide a transformation technique for transforming SQCLP programs and goals into semantically equivalent CLP programs and goals, and a practical Prolog-based implementation of some particularly useful instances of the SQCLP scheme. We also illustrate, by showing some simple---and working---examples, how the prototype can be effectively used as a tool for solving problems where qualification values and proximity relations play a key role. Intended use of SQCLP includes flexible information retrieval applications.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。