Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

What Can Argumentation Do for Inconsistent Ontology Query Answering?

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
  • معلومة اضافية
    • Contributors:
      Graphs for Inferences on Knowledge (GRAPHIK); Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM); Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Inria Sophia Antipolis - Méditerranée (CRISAM); Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria); Centre de Recherche en Informatique de Lens (CRIL); Université d'Artois (UA)-Centre National de la Recherche Scientifique (CNRS)
    • بيانات النشر:
      HAL CCSD
    • الموضوع:
      2013
    • Collection:
      Université de Montpellier: HAL
    • نبذة مختصرة :
      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).
    • Relation:
      Report N°: RR-13007; lirmm-00812630; https://hal-lirmm.ccsd.cnrs.fr/lirmm-00812630; https://hal-lirmm.ccsd.cnrs.fr/lirmm-00812630/document; https://hal-lirmm.ccsd.cnrs.fr/lirmm-00812630/file/TR-Vesic-Croitoru.pdf
    • Rights:
      info:eu-repo/semantics/OpenAccess
    • الرقم المعرف:
      edsbas.768320C4