Skip to main content

Inconsistency Handling for Partially Preordered Ontologies: Going Beyond Elect

  • Conference paper
  • First Online:
Knowledge Science, Engineering and Management (KSEM 2019)

Abstract

We continue investigations into computing repairs for an inconsistent Description Logic (DL) knowledge base (KB). In recent work, a tractable method, called Elect, has been introduced to restore consistency of the ABox w.r.t. the TBox. Elect deals with the case of KBs expressed in DL-Lite and when a partial preorder is applied to the ABox. It has been shown that Elect generalizes the well-known IAR semantics when no priority relation over the ABox is used, and the so-called non-defeated semantics when the relation is a total preorder. In the present paper, we propose two extensions of Elect. First, we redefine Elect by using a preference-based semantics from the literature but with the drawback of losing tractability. Second, we show under which conditions Elect can be generalized to DLs that are more expressive than DL-Lite.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    We denote by \(\rhd \) the strict preference relation associated with \(\unrhd \).

  2. 2.

    Namely, \({\mathcal {S}}_1=\{f: \not \exists g \in {\mathcal {A}}, g>f\}\) and \(\forall i=2\dots n, {\mathcal {S}}_i=\{f: \not \exists g \in {\mathcal {A}}\setminus ({\mathcal {S}}_1 \cup \dots \cup {\mathcal {S}}_{i-1})\) s.t. \(g>f\}\), where > denotes the strict relation associated with \(\ge \).

References

  1. Baader, F., Calvanese, D., Mcguinness, D., Nardi, D., Patel-Schneider, P.: The Description Logic Handbook: Theory, Implementation, and Applications (2007)

    Google Scholar 

  2. Baget, J., et al.: A general modifier-based framework for inconsistency-tolerant query answering. In: KR, Cape Town, South Africa, pp. 513–516 (2016)

    Google Scholar 

  3. Belabbes, S., Benferhat, S., Chomicki, J.: Elect: An inconsistency handling approach for partially preordered lightweight ontologies. In: LPNMR, Philadelphia, USA, pp. 210–223 (2019)

    Chapter  Google Scholar 

  4. Benferhat, S., Bouraoui, Z., Tabia, K.: How to select one preferred assertional-based repair from inconsistent and prioritized DL-Lite knowledge bases? In: IJCAI, Buenos Aires, Argentina, pp. 1450–1456 (2015)

    Google Scholar 

  5. Benferhat, S., Dubois, D., Prade, H.: Some Syntactic Approaches to the Handling of Inconsistent Knowledge Bases: A Comparative Study. Part 2 : The Prioritized Case, vol. 24, pp. 473–511. Physica-Verlag, Heidelberg (1998)

    Google Scholar 

  6. Bienvenu, M., Bourgaux, C., Goasdoué, F.: Querying inconsistent description logic knowledge bases under preferred repair semantics. In: AAAI, pp. 996–1002 (2014)

    Google Scholar 

  7. Bienvenu, M., Bourgaux, C.: Inconsistency-tolerant querying of description logic knowledge bases. In: Pan, J.Z., et al. (eds.) Reasoning Web 2016. LNCS, vol. 9885, pp. 156–202. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-49493-7_5

    Chapter  MATH  Google Scholar 

  8. Brewka, G.: Preferred subtheories: an extended logical framework for default reasoning. In: IJCAI, Detroit, USA, pp. 1043–1048 (1989)

    Google Scholar 

  9. Calvanese, D., Kharlamov, E., Nutt, W., Zheleznyakov, D.: Evolution of \(DL\)\(Lite\) knowledge bases. In: Patel-Schneider, P.F., et al. (eds.) ISWC 2010. LNCS, vol. 6496, pp. 112–128. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-17746-0_8

    Chapter  Google Scholar 

  10. Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Tractable reasoning and efficient query answering in description logics: the DL-Lite family. J. Autom. Reason. 39(3), 385–429 (2007)

    Article  MathSciNet  Google Scholar 

  11. Lembo, D., Lenzerini, M., Rosati, R., Ruzzi, M., Savo, D.F.: Inconsistency-tolerant semantics for description logics. In: Hitzler, P., Lukasiewicz, T. (eds.) RR 2010. LNCS, vol. 6333, pp. 103–117. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-15918-3_9

    Chapter  Google Scholar 

  12. Lukasiewicz, T., Martinez, M.V., Simari, G.I.: Inconsistency handling in datalog+/- ontologies. In: ECAI, Montpellier, France, pp. 558–563 (2012)

    Google Scholar 

  13. Tsalapati, E., Stoilos, G., Stamou, G., Koletsos, G.: Efficient query answering over expressive inconsistent description logics. In: IJCAI, New York, USA, pp. 1279–1285 (2016)

    Google Scholar 

Download references

Acknowledgements

This work was supported by the European project H2020-MSCA-RISE: AniAge (High Dimensional Heterogeneous Data based Animation Techniques for Southeast Asian Intangible Cultural Heritage).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sihem Belabbes .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Belabbes, S., Benferhat, S. (2019). Inconsistency Handling for Partially Preordered Ontologies: Going Beyond Elect. In: Douligeris, C., Karagiannis, D., Apostolou, D. (eds) Knowledge Science, Engineering and Management. KSEM 2019. Lecture Notes in Computer Science(), vol 11775. Springer, Cham. https://doi.org/10.1007/978-3-030-29551-6_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-29551-6_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-29550-9

  • Online ISBN: 978-3-030-29551-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics