# Answering Fuzzy Queries over Fuzzy DL-Lite Ontologies

arXiv: https://arxiv.org/abs/2111.11779 · HTML: https://mlsanity.com/paper/2111.11779/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- Builds on 1 of its 33 references that are in the map.
- First posted on arXiv 23 Nov 2021.

## Builds on (most cited first, 1 of 1)

- [The DL-Lite Family and Relations](https://mlsanity.com/paper/1401.3487/) (2014)

## Built on by (most cited first, 1 of 1)

- [LLM-based Argument Mining meets Argumentation and Description Logics: a Unified Framework for Reasoning about Debates](https://mlsanity.com/paper/2603.02858/) (2026)

## Abstract (arXiv)

A prominent problem in knowledge representation is how to answer queries taking into account also the implicit consequences of an ontology representing domain knowledge. While this problem has been widely studied within the realm of description logic ontologies, it has been surprisingly neglected within the context of vague or imprecise knowledge, particularly from the point of view of mathematical fuzzy logic. In this paper we study the problem of answering conjunctive queries and threshold queries w.r.t. ontologies in fuzzy DL-Lite. Specifically, we show through a rewriting approach that threshold query answering w.r.t. consistent ontologies remains in AC0 in data complexity, but that conjunctive query answering is highly dependent on the selected triangular norm, which has an impact on the underlying semantics. For the idempodent G"odel t-norm, we provide an effective method based on a reduction to the classical case. This paper is under consideration in Theory and Practice of Logic Programming (TPLP).