2 research outputs found

    Reasoning in inconsistent prioritized knowledge bases: an argumentative approach

    Get PDF
    A study of query answering in prioritized ontological knowledge bases (KBs) has received attention in recent years. While several semantics of query answering have been proposed and their complexity is rather well-understood, the problem of explaining inconsistency-tolerant query answers has paid less attention. Explaining query answers permits users to understand not only what is entailed or not entailed by an inconsistent DL-LiteR KBs in the presence of priority, but also why. We, therefore, concern with the use of argumentation frameworks to allow users to better understand explanation techniques of querying answers over inconsistent DL-LiteR KBs in the presence of priority. More specifically, we propose a new variant of Dung’s argumentation frameworks, which corresponds to a given inconsistent DL-LiteR KB. We clarify a close relation between preferred subtheories adopted in such prioritized DL-LiteR setting and acceptable semantics of the corresponding argumentation framework. The significant result paves the way for applying algorithms and proof theories to establish preferred subtheories inferences in prioritized DL-LiteR KBs

    Handling disagreement in ontologies-based reasoning via argumentation

    No full text
    International audienceOntologies are at the heart of the Semantic Web technologies. This paper introduces a framework for reasoning under uncertainty in the context of ontologies represented in description logics; these ontologies could be inconsis- tent or incoherent. Conflicts are addressed through a form of logic-based argu- mentation. We examine how the number of attacks and the weights of arguments can be used to define various labelling functions that identify the justification statuses of arguments. Then, different inference relations are distinguished to obtain meaningful answers to queries from imperfect ontologies without extra computational costs compared to classical DL reasoning. Lastly, we study the properties of these new entailment relations and their relationships with other well-known existing ones
    corecore