What Can Argumentation Do for Inconsistent Ontology Query Answering?

Madalina Croitoru (1) , Srdjan Vesic (2)

1 GRAPHIK - Graphs for Inferences on Knowledge
2 CRIL - Centre de Recherche en Informatique de Lens

The area of inconsistent ontological knowledge base query answering studies the problem of inferring from an inconsistent ontology. To deal with such a situation, different semantics have been defined in the literature (e.g. AR, IAR, ICR). Argumentation theory can also be used to draw conclusions under inconsistency. Given a set of arguments and attacks between them, one applies a particular semantics (e.g. stable, preferred, grounded) to calculate the sets of accepted arguments and conclusions. However, it is not clear what are the similarities and differences of semantics from ontological knowledge base query answering and semantics from argumentation theory. This paper provides the answer to that question. Namely, we prove that: (1) sceptical acceptance under stable and preferred semantics corresponds to ICR semantics; (2) universal acceptance under stable and preferred semantics corresponds to AR semantics; (3) acceptance under grounded semantics corresponds to IAR semantics. We also prove that the argumentation framework we define satisfies the rationality postulates (e.g. consistency, closure).

Domaines: Intelligence artificielle [cs.AI]

Madalina Croitoru, Srdjan Vesic. What Can Argumentation Do for Inconsistent Ontology Query Answering?. RR-13007, 2013, pp.17. ⟨lirmm-00812630⟩