Elect: An Inconsistency Handling Approach for Partially Preordered Lightweight Ontologies

Belabbès, Sihem; Benferhat, Salem; Chomicki, Jan

doi:10.1007/978-3-030-20528-7_16

Cited by 9 publications

(9 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As the grounded repair can be computed in polynomial time from the dataset and conflicts, it yields a tractable approximation of the Pareto variant of the IAR semantics for the considered DLs. Moreover, we show that it is more productive than the recently proposed Elect semantics (Belabbes, Benferhat, and Chomicki 2019;. These advantages motivate us to take a closer look at the computational properties of the grounded semantics.…”

Section: Introductionmentioning

confidence: 82%

“…The grounded semantics can be compared to another recently proposed semantics for prioritized KBs, the Elect semantics, defined for KBs with binary conflicts by Belabbes, Benferhat, and Chomicki (2019) then generalized for non-binary conflicts . Elect evaluates queries over a set of elected assertions and is tractable for DLs for which computing the conflicts and BCQ entailment can be done in polynomial time w.r.t.…”

Section: Grounded Semantics For Prioritized Kbsmentioning

confidence: 99%

See 1 more Smart Citation

Querying and Repairing Inconsistent Prioritized Knowledge Bases: Complexity Analysis and Links with Abstract Argumentation

Bourgaux¹

2020

Preprint

View full text Add to dashboard Cite

In this paper, we explore the issue of inconsistency handling over prioritized knowledge bases (KBs), which consist of an ontology, a set of facts, and a priority relation between conflicting facts. In the database setting, a closely related scenario has been studied and led to the definition of three different notions of optimal repairs (global, Pareto, and completion) of a prioritized inconsistent database. After transferring the notions of globally-, Pareto-and completion-optimal repairs to our setting, we study the data complexity of the core reasoning tasks: query entailment under inconsistencytolerant semantics based upon optimal repairs, existence of a unique optimal repair, and enumeration of all optimal repairs. Our results provide a nearly complete picture of the data complexity of these tasks for ontologies formulated in common DL-Lite dialects. The second contribution of our work is to clarify the relationship between optimal repairs and different notions of extensions for (set-based) argumentation frameworks. Among our results, we show that Pareto-optimal repairs correspond precisely to stable extensions (and often also to preferred extensions), and we propose a novel semantics for prioritized KBs which is inspired by grounded extensions and enjoys favourable computational properties. Our study also yields some results of independent interest concerning preference-based argumentation frameworks.

show abstract

Section: Introductionmentioning

confidence: 82%

Section: Grounded Semantics For Prioritized Kbsmentioning

confidence: 99%

Querying and Repairing Inconsistent Prioritized Knowledge Bases: Complexity Analysis and Links with Abstract Argumentation

Bourgaux¹

2020

Preprint

View full text Add to dashboard Cite

show abstract

“…Namely, we seek a tractable method that also returns one (preferred) repair for a partially preordered ABox. We call our method Elect and denote by Elect(A, ) the repair it returns [12]. As we shall see later, Elect extends both the IAR semantics and the non-defeated semantics in the cases where the relation is flat and totally preordered respectively.…”

Section: Partially Preordered Assertional Basesmentioning

confidence: 99%

“…Namely, some statements are deemed as more reliable than others and there are statements with in-comparable reliability levels. We provide an efficient and safe method, called Elect, to restore the consistency of the ABox with respect to the TBox [12]. We show that Elect generalizes both the IAR semantics and the non-defeated semantics.…”

Section: Introductionmentioning

confidence: 99%

Handling inconsistency in partially preordered ontologies: the Elect method

Belabbès

Benferhat

Chomicki

2021

Journal of Logic and Computation

Self Cite

View full text Add to dashboard Cite

We focus on the problem of handling inconsistency in lightweight ontologies. We assume that the terminological knowledge base (TBox) is specified in DL-Lite and that the set of assertional facts (ABox) is partially preordered and may be inconsistent with respect to the TBox. One of the main contributions of this paper is the provision of an efficient and safe method, called Elect, to restore the consistency of the ABox with respect to the TBox. In the case where the assertional base is flat (i.e. no priorities are associated with the ABox) or totally preordered, we show that our method collapses with the well-known intersection ABox repair semantics and the non-defeated semantics, respectively. The semantic justification of the Elect method is obtained by first viewing a partially preordered ABox as a family of totally preordered ABoxes and then applying non-defeated inference to each of the totally preordered ABoxes. We introduce the notion of elected assertions which allows us to provide an equivalent characterization of the Elect method without explicitly generating all the totally preordered ABoxes. We show that computing the set of elected assertions is done in polynomial time with respect to the size of the ABox. The second part of the paper discusses how to go beyond the Elect method. In particular, we discuss to what extent the Elect method can be generalized to description logics that are more expressive than DL-Lite.

show abstract

“…Recently, an efficient method, called "Elect", has been proposed for handling inconsistency in partially preordered lightweight ontologies [6]. The Elect method encompasses both the well-known IAR semantics [35] (if the ABox is flat) as well as the so-called non-defeated semantics [7,9] (if the ABox is totally preordered).…”

Section: Introductionmentioning

confidence: 99%

Computing a Possibility Theory Repair for Partially Preordered Inconsistent Ontologies

Belabbès¹,

Benferhat

2022

IEEE Trans. Fuzzy Syst.

Self Cite

View full text Add to dashboard Cite

We address the problem of handling inconsistency in uncertain knowledge bases that are specified in the lightweight fragments of Description Logics DL-Lite. More specifically, we assume that the TBox component is coherent, stable and fully reliable. However, the ABox component may be inconsistent with respect to the TBox, partially preordered and uncertain. Uncertainty is encoded in the framework of possibility theory. In this context, we propose an extension of standard possibilistic DL-Lite. We represent the ABox as a symbolic weighted base, where the weights attached to the assertions are ordered according to a strict partial order. We define a tractable method for computing a single possibilistic repair for a partially preordered weighted ABox. The idea is to consider the possibilistic compatible bases of such an ABox, which intuitively encode all the possible extensions of a partial order, and compute the possibilistic repair of each compatible base. We then compute the intersection of all these possibilistic repairs to obtain a single repair for the initial ABox. We also provide an equivalent characterization by introducing the notion of π-accepted assertions. This ensures that the computation of the partially preordered possibilistic repair can be achieved in polynomial time in DL-Lite.

show abstract

Elect: An Inconsistency Handling Approach for Partially Preordered Lightweight Ontologies

Cited by 9 publications

References 14 publications

Querying and Repairing Inconsistent Prioritized Knowledge Bases: Complexity Analysis and Links with Abstract Argumentation

Querying and Repairing Inconsistent Prioritized Knowledge Bases: Complexity Analysis and Links with Abstract Argumentation

Handling inconsistency in partially preordered ontologies: the Elect method

Computing a Possibility Theory Repair for Partially Preordered Inconsistent Ontologies

Contact Info

Product

Resources

About