A declarative semantics for CLP with qualification and proximity

DOI10.1017/S1471068410000323MaRDI QIDQ3585172zbMATH OpenFDO

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

Publication date 19 August 2010

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1007.3629

zbMATH Keywords

constraint logic programmingproximity relationsqualification domains and values

Mathematics Subject Classification ID

Logic programming (68N17) Semantics in the theory of computing (68Q55)

Abstract: 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.

Recommendations

• A transformation-based implementation for CLP with qualification and proximity
• scientific article; zbMATH DE number 1923157
• Quantitative Logic Programming Revisited
• Qualified logic programming with bivalued predicates
• The semantics of constraint logic programs1Note that reviewing of this paper was handled by the Editor-in-Chief.1

Cites work

• A comparison of fuzzy and annotated logic programming
• Approximate reasoning by similarity-based SLD resolution.
• Formal properties of needed narrowing with similarity relations
• Fuzzy logic programming
• Fuzzy Prolog: A new approach using soft constraints propagation
• Fuzzy sets and systems. Theory and applications
• Observable Semantics for Constraint Logic Programs
• Probabilistic logic programming
• Qualified Computations in Functional Logic Programming
• Quantitative deduction and its fixpoint theory
• Quantitative Logic Programming Revisited
• Similarity relations and fuzzy orderings

Cited in

(11)

• Thresholded semantic framework for a fully integrated fuzzy logic language
• Qualified logic programming with bivalued predicates
• Dedekind–MacNeille completion and Cartesian product of multi-adjoint lattices
• Solving proximity constraints
• On the incorporation of interval-valued fuzzy sets into the Bousi-Prolog system: declarative semantics, implementation and applications
• Proximity-based unification theory
• Qualified Computations in Functional Logic Programming
• A transformation-based implementation for CLP with qualification and proximity
• Quantitative Logic Programming Revisited
• Some properties of substitutions in the framework of similarity relations
• A sound and complete semantics for a similarity-based logic programming language

This page was built for publication: A declarative semantics for CLP with qualification and proximity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3585172)