DeepAI AI Chat
Log In Sign Up

Recursive algorithms to repair prioritized and inconsistent dl-lite knowledge base

by   Ghassen Hamdi, et al.
University of Biskra
FS de Monastir

The inconsistency in prioritized knowledge base is because the assertions (ABoxes) come from several sources with different levels of reliability. We introduce the handling of this inconsistency problem to query inconsistent DL-Lite knowledge bases. In the literature, firstly, repair all the inconsistent assertions of the DL-Lite's inconsistent knowledge base. Then, interrogate it. However, our algorithm, on proceeds directly with an interrogation of the knowledge base in order to recover an exhaustive list of answers to a given query. In a second time, to repair the answers of this list. The novelty of our article is the proposition of a recurring function that calculates the rank of coherence in order to manage the inconsistencies in the set of responses. This strategy allowed us to reduce execution time compared to existing algorithms. The experimental study as well as the analysis of the results, which we carried out, showed that our algorithm is much more productive than the other algorithms since it gives the greatest number of answers while remaining the best from the point of view of the execution time. Finally, as shown in our experimental studies, they allow an efficient handling of inconsistency. Such facts make all the repairs suitable for DL-Lite


page 1

page 2

page 3

page 4


Cleaning Inconsistent Data in Temporal DL-Lite Under Best Repair Semantics

In this paper, we address the problem of handling inconsistent data in T...

Counting Query Answers over a DL-Lite Knowledge Base (extended version)

Counting answers to a query is an operation supported by virtually all d...

A Distance-based Paraconsistent Semantics for DL-Lite

DL-Lite is an important family of description logics. Recently, there is...

Second-Order Specifications and Quantifier Elimination for Consistent Query Answering in Databases

Consistent answers to a query from a possibly inconsistent database are ...

FastDiagP: An Algorithm for Parallelized Direct Diagnosis

Constraint-based applications attempt to identify a solution that meets ...

Time in a Box: Advancing Knowledge Graph Completion with Temporal Scopes

Almost all statements in knowledge bases have a temporal scope during wh...

Querying Inconsistent Prioritized Data with ORBITS: Algorithms, Implementation, and Experiments

We investigate practical algorithms for inconsistency-tolerant query ans...