Approximate reasoning by similarity-based SLD resolution.

DOI10.1016/S0304-3975(01)00188-8zbMath1051.68045MaRDI QIDQ1607217

Maria I. Sessa

Publication date: 31 July 2002

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

zbMATH Keywords

Logic programmingApproximate reasoningSimilarity relationSLD resolution

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (32)

Similarity-based unification: A multi-adjoint approach ⋮ Similarity-Based Equality with Lazy Evaluation ⋮ Termination of logic programs with imperfect information: applications and query procedure ⋮ Adding similarity-based reasoning capabilities to a Horn fragment of possibilistic logic with fuzzy constants ⋮ Qualified Computations in Functional Logic Programming ⋮ Thresholded semantic framework for a fully integrated fuzzy logic language ⋮ Solving Proximity Constraints ⋮ Seeking a safe and efficient similarity-based unfolding rule ⋮ Fuzzy free logic with dual domain semantics ⋮ An empirically supported approach to the treatment of imprecision in vague reasoning ⋮ From Fuzzy to Annotated Semantic Web Languages ⋮ The fuzzy logic programming language FASILL: design and implementation ⋮ Fuzzy lattice operations on first-order terms over signatures with similar constructors: a constraint-based approach ⋮ SIMILARITY-BASED RELATIONS IN DATALOG PROGRAMS ⋮ A Transformation-based implementation for CLP with qualification and proximity ⋮ Proximity-based unification theory ⋮ Determination of \(\alpha \)-resolution in lattice-valued first-order logic \(\mathrm{LF}(X)\) ⋮ A declarative semantics for CLP with qualification and proximity ⋮ A sound and complete semantics for a similarity-based logic programming language ⋮ Qualified Logic Programming with Bivalued Predicates ⋮ Sound and Complete SLD-Resolution for Bilattice-Based Annotated Logic Programs ⋮ Cognitive Metaphor-Based Fuzzy Similarity Reasoning ⋮ Similarity-based SLD resolution and its role for web knowledge discovery ⋮ A comparison of fuzzy and annotated logic programming ⋮ An improved reductant calculus using fuzzy partial evaluation techniques ⋮ A hybrid programming scheme combining fuzzy-logic and functional-logic resources ⋮ Approximate well-founded semantics, query answering and generalized normal logic programs over lattices ⋮ Two formalisms of extended possibilistic logic programming with context-dependent fuzzy unification ⋮ Formal Properties of Needed Narrowing with Similarity Relations ⋮ Planning for an Efficient Implementation of Hypothetical Bousi∼Prolog ⋮ Editorial: Fuzzy set and possibility theory-based methods in artificial intelligence ⋮ Fuzzy \(rr\)DFCSP and planning

Uses Software

• FPROLOG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On-line algorithms for satisfiability problems with uncertainty
• Resolution principles in possibilistic logic
• A fuzzy relational inference language
• Probabilistic logic
• The implementation of FPROLOG - a fuzzy PROLOG interpreter
• Fundamentals of Fuzzy Prolog
• A fuzzy representation of data for relational databases
• Probabilistic logic programming
• Translations and similarity-based logic programming
• A logical approach to interpolation based on similarity relations
• On the semantics of fuzzy logic
• Similarity relations and fuzzy orderings
• Quantitative deduction and its fixpoint theory
• Abstract interpretation and application to logic programs
• A logic for approximate reasoning
• Approximate Reasoning Based on Similarity
• Fuzzy Logic and the Resolution Principle

This page was built for publication: Approximate reasoning by similarity-based SLD resolution.