A transformation-based implementation for CLP with qualification and proximity

DOI10.1017/S1471068412000014MaRDI QIDQ5410260zbMATH OpenOpenAlexFDO

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

Publication date 16 April 2014

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

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

zbMATH Keywords

constraint logic programmingflexible information retrievalprogram transformationproximity relationsqualification domainsqualification valuessimilarity relations

Mathematics Subject Classification ID

Logic programming (68N17)

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

Recommendations

• A declarative semantics for CLP with qualification and proximity
• Quantitative Logic Programming Revisited
• Qualified Computations in Functional Logic Programming
• Qualified logic programming with bivalued predicates
• scientific article; zbMATH DE number 1980943

Cites work

• A declarative semantics for CLP with qualification and proximity
• A similarity-based resolution rule
• An improved reductant calculus using fuzzy partial evaluation techniques
• Approximate reasoning by similarity-based SLD resolution.
• Functional and logic programming. 9th international symposium, FLOPS 2008, Ise, Japan, April 14--16, 2008. Proceedings
• Fuzzy Logic and the Resolution Principle
• Fuzzy logic programming
• Fuzzy logic. Mathematical tools for approximate reasoning
• Fuzzy Prolog: A new approach using soft constraints propagation
• Fuzzy sets
• scientific article; zbMATH DE number 43398 (Why is no real title available?)
• Likelog for flexible query answering
• Logic programming and nonmonotonic reasoning. 6th international conference, LPNMR 2001, Vienna, Austria, September 17--19, 2001. Proceedings
• Logic programming. 25th international conference, ICLP 2009, Pasadena, CA, USA, July 14--17, 2009. Proceedings
• Metamathematics of fuzzy logic
• Quantitative deduction and its fixpoint theory
• Similarity relations and fuzzy orderings
• Similarity-based SLD resolution and its role for web knowledge discovery
• Similarity-based unification: A multi-adjoint approach
• The semantics of constraint logic programs1Note that reviewing of this paper was handled by the Editor-in-Chief.1
• Translations and similarity-based logic programming

Cited in

(6)

• Thresholded semantic framework for a fully integrated fuzzy logic language
• Qualified logic programming with bivalued predicates
• A declarative semantics for CLP with qualification and proximity
• Qualified Computations in Functional Logic Programming
• Quantitative Logic Programming Revisited
• A sound and complete semantics for a similarity-based logic programming language

This page was built for publication: A transformation-based implementation 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 Q5410260)