A declarative semantics for CLP with qualification and proximity

DOI10.1017/S1471068410000323zbMath1209.68097arXiv1007.3629MaRDI QIDQ3585172

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

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

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

Related Items (7)

Thresholded semantic framework for a fully integrated fuzzy logic language ⋮ Solving Proximity Constraints ⋮ Dedekind–MacNeille completion and Cartesian product of multi-adjoint lattices ⋮ A Transformation-based implementation for CLP with qualification and proximity ⋮ Proximity-based unification theory ⋮ A sound and complete semantics for a similarity-based logic programming language ⋮ On the Incorporation of Interval-Valued Fuzzy Sets into the Bousi-Prolog System: Declarative Semantics, Implementation and Applications

Cites Work

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

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