Fuzzy Logic Programming for Implementing a Flexible XPath-based Query Language

TL;DR: This work is focused on providing to the programmers a repertoire of paths which can be used to retrieve answers and gives a "chance degree" that represents an estimation on its deviation w.r.t. the initial expression.

TL;DR: A fuzzy variant of the XPath query language for the flexible information retrieval on XML documents is presented to provide a repertoire of operators that offer the possibility of managing satisfaction degrees by adding structural constraints and fuzzy operators inside conditions in order to produce a ranked sorted list of answers when composing queries.

TL;DR: This paper deals with propositional fuzzy formulae containing several propositional symbols linked with connectives defined in a lattice of truth degrees more complex than Bool, and uses the ability of the FuzzyXPath tool for exploring these derivation trees once exported in XML format to discover whether the formula is a tautology, satisfiable, or a contradiction.

TL;DR: Fuzzy sets have been extensively used to enhance various database models for managing fuzzy data or flexibly querying crisp data as mentioned in this paper , which has resulted in numerous contributions in this research area.

TL;DR: In this paper, it is shown that the most unreliable clause of a set of clauses has a truth value a>0.5, and that all the logical consequences obtained by repeatedly applying the resolution principle has truth-value never smaller than a.

TL;DR: A formal model for similarity-based fuzzy unification in multi-adjoint logic programs is built, a procedural semantics for this framework is presented, and an approximative-completeness theorem is proved.

TL;DR: In this article, Atanassov's Intuitionistic Fuzzy Sets are used as a classification model for web usage mining and their applications are described and compared to the use of the Checklist Paradigm Measure m 3 to approximately query XML documents.