Polynomial Algorithms for Computing a Single Preferred Assertional-Based Repair

Telli, Abdelmoutia; Benferhat, Salem; Bourahla, Mustapha; Bouraoui, Zied; Tabia, Karim

doi:10.1007/s13218-016-0466-4

Cited by 11 publications

(9 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition, Benferhat et al (2015Benferhat et al ( , 2016 propose a new non-objection inference relation based on the option of only one preferred repair and discuss the complexity of computation inference on ideal repair. Additionally, Telli et al (2017) propose polynomial strategies for finding a unification repair consistent under all the DL-Lite knowledge bases;…”

Section: Related Workmentioning

confidence: 99%

Lexicographic Repair Under Querying Prioritised DL-Lite Knowledge Bases

Telli¹,

Hamdi²,

Nazih³

2021

BAS-SJKFU

View full text Add to dashboard Cite

This article discusses the issue of inconsistency in responses from various DL-Lite knowledge bases. This inconsistency problem is at the origin of several sources of assertions with different levels of reliability. The various solutions proposed in the literature that have to do with retrieving an exhaustive and coherent list of responses are not satisfactory from the point of view of reliability and performance. The solution that we present to solve this problem is articulated around two phases: the first phase consists of interrogating the different knowledge bases to retrieve all of the possible answers, which may be inconsistent and/or contradictory, and the second phase consists in repairing these inconsistencies and/or contradictions. To do this, we propose an approach based on three algorithms that we developed in this framework: a first algorithm for non-defeat repair, a second algorithm for lexicographic repair and a third algorithm for non-defeat repair based on lexicography of possible inconsistent responses. The experimental study carried out on the different data collections, as well as the analysis of the results obtained, confirm the performance of our approach as well as its efficiency in regards to productivity and complexity in terms of execution time.

show abstract

Section: Related Workmentioning

confidence: 99%

Lexicographic Repair Under Querying Prioritised DL-Lite Knowledge Bases

Telli¹,

Hamdi²,

Nazih³

2021

BAS-SJKFU

View full text Add to dashboard Cite

show abstract

“…While, the consistency rank of P s equal 1. Moreover, we have the the following free sets of qp s : R(e, z), R(c, z)} Although, if we use the definitions of possibilistic-based repair, linear-based repair and non-defeated repair proposed in ( [15,25]) directly on P s (before querying), we have:…”

Section: Possibilistic-based Repairs Answersmentioning

confidence: 99%

“…These ABoxes with respectively 50, 200 and 500 conflict sets. We ran the proposed algorithms in [25] and our developed algorithms for computing repairs before and after launching a instance, ground and conjunctive query.…”

Section: Experimental Evaluationmentioning

confidence: 99%

“…For instance, the authors in [11,12,45,47,48] investigate the problem of inconsistency in KBs by computing a set of consistent subsets of assertions called repairs, which recovers the consistency with respect to the ontology, and then using them to answer the queries. Moreover, the authors propose in [15,25] polynomials algorithms for select a single preferred repair from a prioritized inconsistent DL-Lite KB to allow an efficient query answering once the repair is computed. Particularly, the authors in [15] propose a new approach based on the selection of only one preferred repair.…”

Section: Related Workmentioning

confidence: 99%

“…Particularly, the authors in [15] propose a new approach based on the selection of only one preferred repair. However, in [25], the authors propose a sequential inference strategies based on the selection of one consistent assertional base. The authors in [49,50,51] propound a new algorithm which makes easy to query answering without access to Web databases.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

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

Hamdi,

Telli,

Omri

2019

Preprint

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Towards New Model for Handling Inconsistency Issues in DL-Lite Knowledge Bases

Hamdi

Omri

2021

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Polynomial Algorithms for Computing a Single Preferred Assertional-Based Repair

Cited by 11 publications

References 19 publications

Lexicographic Repair Under Querying Prioritised DL-Lite Knowledge Bases

Lexicographic Repair Under Querying Prioritised DL-Lite Knowledge Bases

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

Towards New Model for Handling Inconsistency Issues in DL-Lite Knowledge Bases

Contact Info

Product

Resources

About