A top-k query answering procedure for fuzzy logic programming
References (85)
Annotated fuzzy logic programs
Fuzzy Sets Syst.
(2000)- et al.
Termination of logic programs with imperfect information: applications and query procedure
J. Appl. Logic
(2007) Fuzzy logic programming
Fuzzy Sets Syst.
(2001)Fixpoint semantics for logic programming—a survey
Theoret. Comput. Sci.
(2002)- et al.
Supporting top-k join queries in relational databases
- et al.
Theory of generalized annotated logic programming and its applications
J. Logic Prog.
(1992) - et al.
A comparison of fuzzy and annotated logic programming
Fuzzy Sets Syst.
(2004) - et al.
Any-world assumptions in logic programming
Theoret. Comput. Sci.
(2005) - et al.
Description logic programs under probabilistic uncertainty and fuzzy vagueness
Int. J. Approxi. Reason.
(2009) - et al.
Fuzzy matchmaking in e-marketplaces of peer entities using Datalog
Fuzzy Sets Syst.
(2009)
Quantitative deduction and its fixpoint theory
J. Logic Prog.
Fuzzy logic programming
Fuzzy Sets Syst.
Fuzzy logic aggregation for semantic web search for the best (top-k) answer
A complete calculus for possibilistic logic programming with fuzzy propositional variables with fuzzy propositional variables
Towards an automated deduction system for first-order possibilistic logic programming with fuzzy constants
Int. J. Intell. Syst.
On the semantics and automated deduction for PLFC
A theory of mass assignments for artificial intelligence
Fril—Fuzzy and Evidential Reasoning in Artificial Intelligence
Probabilistic reasoning with answer sets
Top-k selection queries over relational databases: mapping strategies and performance evaluation
ACM Trans. Database Syst.
Data complexity of query answering in description logics
Minimal probing: supporting expensive predicates for top-k queries
A logic programming framework for possibilistic argumentation with vague knowledge
Integrated query answering with weighted fuzzy rules
Top-down computation of the semantics of weighted fuzzy logic programs
Hybrid probabilistic logic programs as residuated logic programs
Studia Logica
Sorted multi-adjoint logic programs: termination results and applications
Sorted monotonic logic programs and their embeddings
A tabulation procedure for first-order residuated logic programs
A tabulation procedure for first-order residuated logic programs
Complexity and expressive power of logic programming
ACM Comput. Surv.
Revisiting the semantics of interval probabilistic logic programs
Ultimate well-founded and stable semantics for logic programs with aggregates
Towards possibilistic logic programming
Combining fuzzy information: an overview
SIGMOD Rec.
Optimal aggregation algorithms for middleware
Procedural semantics for fuzzy disjunctive programs
Adaptive rank-aware query optimization in relational databases
ACM Trans. Database Syst.
Efficient thresholded tabulation for fuzzy query answering
Cited by (21)
The f-index of inclusion as optimal adjoint pair for fuzzy modus ponens
2023, Fuzzy Sets and SystemsBousi∼Prolog: Design and implementation of a proximity-based fuzzy logic programming language
2023, Expert Systems with ApplicationsCitation Excerpt :Fuzzy Logic Programming (Lee, 1972) amalgamates logic programming (van Emden & Kowalski, 1976) with concepts coming from fuzzy logic (Zadeh, 1965) to deal with vagueness und uncertainty. In recent years there has been a renewed interest on this field, with multiple approaches such as (Alsinet et al., 2008; Cornejo et al., 2018; Fontana & Formato, 2002; Guadarrama et al., 2004; Julián-Iranzo et al., 2017; Loia et al., 2001; Medina et al., 2007, 2004; Sessa, 2002; Straccia & Madrid, 2012; Vojtáš, 2001). Bousi∼Prolog (BPL) (Julián-Iranzo & Rubio-Manzano, 2017; Rubio-Manzano & Julián-Iranzo, 2014) is an extension of the Prolog language, implemented in SWI-Prolog and C, and publicly available as a desktop application (dectau.uclm.es/bousi-prolog), a pack for SWI-Prolog (www.swi-prolog.org/pack/list?p=bousi_pack), and an online system (dectau.uclm.es:8443).
Functional degrees of inclusion and similarity between L-fuzzy sets
2020, Fuzzy Sets and SystemsA Top-K Retrieval algorithm based on a decomposition of ranking functions.
2019, Information SciencesCitation Excerpt :Under the former requirement, top-k algorithms can be split out in classes according to the family of the used ranking function: e.g., there are approaches which consider a very specific kind of the ranking function (as the family of “Top-k dominating queries” approaches [21,26] or the family of “Top-k spatial queries” approaches [8,25]) and approaches that work with more general families of ranking functions: as monotonic ranking functions [5,12,14], distances [4,8], and similarity functions [13,29]. From a data structure point of view, approaches go from general structures like relational tables [12] to other more complex like R-trees [25], Graphs [29], or Fuzzy Logic programs [28]. This paper pretends to increase the range of application of top-k retrieval algorithms.
Accurate and efficient profile matching in knowledge bases
2018, Data and Knowledge EngineeringCitation Excerpt :This is particularly the case for join queries [26] or for the determination of a dominant query [27]. Extensions in the direction of fuzzy logic [28] and probabilities have also been tried [29]. For our purposes here, most of the research on top-k query processing is only marginally relevant, because it is not linked to the specific problem of finding the best matches.
Tabulation proof procedures for fuzzy linguistic logic programming
2015, International Journal of Approximate ReasoningCitation Excerpt :Other frameworks in this approach include monotonic and residuated LP [9], multi-adjoint LP [35,36], and fuzzy semantic web rule language [46]. The framework in [51] can also be classified into the IB approach. The following can be seen: (i) while the way implication is treated in the AB approach is closer to classical logic, the IB approach is an elegant extension of traditional LP since it allows one to explicitly represent and reason with partial truth; (ii) the AB approach is more expressive than the IB.