具有限定和邻近的CLP的声明语义
A Declarative Semantics for CLP with Qualification and Proximity
摘要：
在过去的几十年里，逻辑程序设计中的不确定性已经被研究，涉及经典LP范式的各种扩展和不同的应用。现有的建议依赖于不同的方法，如基于不确定真值的子句注释，作为不确定真值的概括的资格值，以及基于邻近关系的统一。另一方面，CLP方案已经确立了自己作为一个强大的扩展LP，支持高效的计算在专门的领域，同时保持一个干净的声明语义。在本文中，我们提出了一个新的计划SQCLP设计作为CLP的扩展，支持资格值和邻近关系。我们表明，以前的几个建议可以被视为新方案的特殊情况下，通过部分实例化。我们提出了一个声明性的语义SQCLP是基于可观的，提供不动点和证明理论的最小程序模型的特征，以及实现独立的概念的目标解决方案。
英文摘要：
Uncertainty in Logic Programming has been investigated during the last decades, dealing with various extensions of the classical LP paradigm and different applications. Existing proposals rely on different approaches, such as clause annotations based on uncertain truth values, qualification values as a generalization of uncertain truth values, and unification based on proximity relations. On the other hand, the CLP scheme has established itself as a powerful extension of LP that supports efficient computation over specialized domains while keeping a clean declarative semantics. In this paper we propose a new scheme SQCLP designed as an extension of CLP that supports qualification values and proximity relations. We show that several previous proposals can be viewed as particular cases of the new scheme, obtained by partial instantiation. We present a declarative semantics for SQCLP that is based on observables, providing fixpoint and proof-theoretical characterizations of least program models as well as an implementation-independent notion of goal solutions.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
