EUVIMEDEUVIMED entdecken
Crossref

Handling inconsistency in partially preordered ontologies: the Elect method

Sihem Belabbes, Salem Benferhat, Jan Chomicki

Journal of Logic and Computation · 23.07.2021 · 31 (5) · 1356-1388

DOI: 10.1093/logcom/exab024 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Logic and Computation, online erschienen am 22.04.2021. Verfasst von Sihem Belabbes und 2 weiteren Autor:innen. Die Arbeit wurde bisher 13-mal zitiert (Crossref) und nennt 73 Literaturangaben. Gefördert von: European Project H2020 Marie Sklodowska-Curie Actions, Research and Innovation Staff Exchange, University of Artoi.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Förderung

  • European Project H2020 Marie Sklodowska-Curie Actions, Research and Innovation Staff Exchange
  • University of Artoi

Zitieren

APA

Belabbes, S., Benferhat, S., & Chomicki, J. (2021). Handling inconsistency in partially preordered ontologies: the Elect method. Journal of Logic and Computation, 31(5), 1356-1388. https://doi.org/10.1093/logcom/exab024

Vancouver

Belabbes S, Benferhat S, Chomicki J. Handling inconsistency in partially preordered ontologies: the Elect method. Journal of Logic and Computation. 2021;31(5):1356-1388. doi:10.1093/logcom/exab024

BibTeX
@article{Belabbes2021,
  author = {Belabbes, Sihem and Benferhat, Salem and Chomicki, Jan},
  title = {Handling inconsistency in partially preordered ontologies: the Elect method},
  journal = {Journal of Logic and Computation},
  year = {2021},
  volume = {31},
  number = {5},
  pages = {1356--1388},
  doi = {10.1093/logcom/exab024}
}
Kostenlos starten →