Characterizing Non-Defeated Repairs in Inconsistent Lightweight Ontologies

Benferhat, Salem; Bouraoui, Zied; Chadhry, Huma; Fc, Mohd Shafry Bin Mohd Rahim; Tabia, Karim; Telli, Abdelmoutia

doi:10.1109/sitis.2016.53

Cited by 4 publications

(4 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In future, more traits from human psychology can be studied to improve the honesty based influence model. Moreover, improved ranking techniques (Benferhat, et al, 2016;Beg & Rahid, 2017) can be included to rank the alternatives for final outcome and applications of crowd detection (Benferhat, et al, 2016;Bezdek, , Bonnie , & Spillman, 1978;Chaudhry, Karim, Abdul Rahim, & BenFerhat, 2017) can be used in future to develop the theory of influence further.…”

Section: Discussionmentioning

confidence: 99%

Role of honesty and confined interpersonal influence in modelling predilections

Khalid

Beg

2019

Soft Comput

View full text Add to dashboard Cite

Classical models of decision-making do not incorporate for the role of influence and honesty that affects the process. This paper develops on the theory of influence in social network analysis. We study the role of influence and honesty of individual experts on collective outcomes. It is assumed that experts have the tendency to improve their initial predilection for an alternative, over the rest, if they interact with one another. It is suggested that this revised predilection may not be proposed with complete honesty by the expert. Degree of honesty is computed from the preference relation provided by the experts. This measure is dependent on average fuzziness in the relation and its disparity from an additive reciprocal relation. Moreover, an algorithm is introduced to cater for incompleteness in the adjacency matrix of interpersonal influences. This is done by analysing the information on how the expert has influenced others and how others have influenced the expert.

show abstract

Section: Discussionmentioning

confidence: 99%

Role of honesty and confined interpersonal influence in modelling predilections

Khalid

Beg

2019

Soft Comput

View full text Add to dashboard Cite

show abstract

“…Definition 7 also extends the notion of non-defeated assertions given for non-defeated repairs in totally preordered KBs [17]. Lastly, the notion of elected assertions is in the spirit of the notion of accepted beliefs introduced in uncertainty theories [40].…”

Section: Characterizing Elect(a )mentioning

confidence: 97%

“…However, the non-defeated repair is computed in polynomial time in DL-Lite R while its computation is hard in propositional logic. Lastly, in [17] a rewriting (similar to that of IAR(A)) is given for nd(A, ≥). Basically, an assertion f ∈ S i is said to be defeated if there is an assertion g ∈ S j such that j ≤ i and g conflicts with f .…”

Section: Non-defeated Repair For Prioritized Assertional Basesmentioning

confidence: 99%

See 1 more Smart Citation

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