Elsevier

Fuzzy Sets and Systems

Volume 205, 16 October 2012, Pages 1-29
Fuzzy Sets and Systems

A top-k query answering procedure for fuzzy logic programming

https://doi.org/10.1016/j.fss.2012.01.016Get rights and content

Abstract

We present a top-k query answering procedure for Fuzzy Logic Programming, in which arbitrary computable functions may appear in the rule bodies to manipulate truth values. The top-k ranking problem, i.e. determining the top k answers to a query, becomes important as soon as the set of facts becomes quite large.

References (85)

  • M.H. van Emden

    Quantitative deduction and its fixpoint theory

    J. Logic Prog.

    (1986)
  • P. Vojtás

    Fuzzy logic programming

    Fuzzy Sets Syst.

    (2001)
  • P. Vojtás

    Fuzzy logic aggregation for semantic web search for the best (top-k) answer

  • T. Alsinet et al.

    A complete calculus for possibilistic logic programming with fuzzy propositional variables with fuzzy propositional variables

  • T. Alsinet et al.

    Towards an automated deduction system for first-order possibilistic logic programming with fuzzy constants

    Int. J. Intell. Syst.

    (2002)
  • T. Alsinet et al.

    On the semantics and automated deduction for PLFC

  • H.R. Andersen, Local Computation of Simultaneous Fixed-Points, Technical Report PB-420, DAIMI, 1992, see also...
  • J.F. Baldwin

    A theory of mass assignments for artificial intelligence

  • J.F. Baldwin et al.

    Fril—Fuzzy and Evidential Reasoning in Artificial Intelligence

    (1995)
  • C. Baral et al.

    Probabilistic reasoning with answer sets

  • N. Bruno et al.

    Top-k selection queries over relational databases: mapping strategies and performance evaluation

    ACM Trans. Database Syst.

    (2002)
  • D. Calvanese et al.

    Data complexity of query answering in description logics

  • K.C.-C. Chang et al.

    Minimal probing: supporting expensive predicates for top-k queries

  • C. Chesñevar et al.

    A logic programming framework for possibilistic argumentation with vague knowledge

  • A. Chortaras et al.

    Integrated query answering with weighted fuzzy rules

  • A. Chortaras et al.

    Top-down computation of the semantics of weighted fuzzy logic programs

  • C.V. Damásio et al.

    Hybrid probabilistic logic programs as residuated logic programs

    Studia Logica

    (2002)
  • C.V. Damásio et al.

    Sorted multi-adjoint logic programs: termination results and applications

  • C.V. Damásio et al.

    Sorted monotonic logic programs and their embeddings

  • C.V. Damásio et al.

    A tabulation procedure for first-order residuated logic programs

  • C.V. Damásio et al.

    A tabulation procedure for first-order residuated logic programs

  • E. Dantsin et al.

    Complexity and expressive power of logic programming

    ACM Comput. Surv.

    (2001)
  • A. Dekhtyar et al.

    Revisiting the semantics of interval probabilistic logic programs

  • M. Denecker et al.

    Ultimate well-founded and stable semantics for logic programs with aggregates

  • D. Dubois et al.

    Towards possibilistic logic programming

  • R. Fagin

    Combining fuzzy information: an overview

    SIGMOD Rec.

    (2002)
  • R. Fagin et al.

    Optimal aggregation algorithms for middleware

  • D. Guller

    Procedural semantics for fuzzy disjunctive programs

  • I.F. Ilyas et al.

    Adaptive rank-aware query optimization in relational databases

    ACM Trans. Database Syst.

    (2006)
  • M. Ishizuka, N. Kanai, Prolog-ELF: incorporating fuzzy logic, in: Proceedings of the Ninth International Joint...
  • P. Julián-Iranzo et al.

    Efficient thresholded tabulation for fuzzy query answering

  • Cited by (21)

    • Bousi∼Prolog: Design and implementation of a proximity-based fuzzy logic programming language

      2023, Expert Systems with Applications
      Citation 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).

    • A Top-K Retrieval algorithm based on a decomposition of ranking functions.

      2019, Information Sciences
      Citation 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 Engineering
      Citation 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 Reasoning
      Citation 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.

    View all citing articles on Scopus
    View full text