Formal Properties of Needed Narrowing with Similarity Relations

DOI10.1016/j.entcs.2007.05.036zbMath1278.68060OpenAlexW1988066322WikidataQ130571685 ScholiaQ130571685MaRDI QIDQ2867957

Ginés Moreno, Vicente Pascual

Publication date: 20 December 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2007.05.036

zbMATH Keywords

similarityfunctional logic programmingneeded narrowing

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Functional programming and lambda calculus (68N18)

Related Items (4)

Qualified Computations in Functional Logic Programming ⋮ A declarative semantics for CLP with qualification and proximity ⋮ Qualified Logic Programming with Bivalued Predicates ⋮ A hybrid programming scheme combining fuzzy-logic and functional-logic resources

Uses Software

• Likelog

Cites Work

• Unnamed Item
• Unnamed Item
• Approximate reasoning by similarity-based SLD resolution.
• Similarity relations and fuzzy orderings
• A needed narrowing strategy
• Programming with Fuzzy Logic and Mathematical Functions
• Modeling Decisions for Artificial Intelligence

This page was built for publication: Formal Properties of Needed Narrowing with Similarity Relations