Skip to main content

Qualitative-Based Possibilistic \(\mathcal {EL}\) Ontology

  • Conference paper
  • First Online:
PRIMA 2018: Principles and Practice of Multi-Agent Systems (PRIMA 2018)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 11224))

Abstract

In different situations, information coming from different sources are often affected with uncertainty and imprecision. Representing such information generally gives rise to a prioritized (i.e. stratified) knowledge base. To reason with such prioritized knowledge in a principled way, we propose an extension of \(\mathcal {EL}\) description logics within possibility theory, which provides a very natural framework to deal with ordinal, qualitative uncertainty, preferences and priorities. We first introduce the syntax and semantics of possibilistic \(\mathcal {EL}\), and then provide the main related reasoning tasks. We show in particular that these tasks remain tractable in possibilistic \(\mathcal {EL}\).

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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.

    https://www.w3.org/TR/owl2-overview/.

  2. 2.

    In fact, it is a mapping from \(\varOmega \) to a totally ordered scale O. This scale may often be a finite set of integers or the unit interval \(\left[ 0,1\right] \) and encodes our knowledge on the real world. In general, one considers the interval \(\left[ 0,1\right] \).

References

  1. Baader, F.: The Description Logic Handbook: Theory, Implementation and Applications. Cambridge University Press, Cambridge (2003)

    Google Scholar 

  2. Baader, F., Brandt, S., Lutz, C.: Pushing the EL envelope. In: Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI 2005, Edinburgh, Scotland, UK, 30 July–5 August 2005, pp. 364–369 (2005)

    Google Scholar 

  3. Baader, F., Brandt, S., Lutz, C.: Pushing the EL envelope. In: IJCAI, vol. 5, pp. 364–369 (2005)

    Google Scholar 

  4. Baader, F., Brandt, S., Lutz, C.: Pushing the EL envelope further (2008)

    Google Scholar 

  5. Baader, F., Lutz, C., Brandt, S.: Pushing the EL envelope further. In: Proceedings of the Fourth OWLED Workshop on OWL: Experiences and Directions, Washington, DC, USA, 1–2 April 2008 (2008)

    Google Scholar 

  6. Baader, F., Lutz, C., Suntisrivaraporn, B.: Is tractable reasoning in extensions of the description logic EL useful in practice. In: Proceedings of the 2005 International Workshop on Methods for Modalities, M4M 2005, vol. 450. Citeseer (2005)

    Google Scholar 

  7. Benferhat, S., Bouraoui, Z.: Min-based possibilistic DL-Lite. J. Log. Comput. 27(1), 261–297 (2017)

    Article  MathSciNet  Google Scholar 

  8. Benferhat, S., Bouraoui, Z., Tabia, K.: How to select one preferred assertional-based repair from inconsistent and prioritized DL-Lite knowledge bases? In: Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, 25–31 July 2015, pp. 1450–1456 (2015)

    Google Scholar 

  9. Bobillo, F., Straccia, U.: Generalized fuzzy rough description logics. Inf. Sci. 189, 43–62 (2012)

    Article  MathSciNet  Google Scholar 

  10. Boutouhami, K., Benferhat, S., Khellaf, F., Nouioua, F.: Uncertain lightweight ontologies in a product-based possibility theory framework. Int. J. Approx. Reason. 88, 237–258 (2017)

    Article  MathSciNet  Google Scholar 

  11. Dubois, D., Prade, H.: Possibility theory. In: Computational Complexity, pp. 2240–2252. Springer, New York (2012). https://doi.org/10.1007/978-1-4614-1800-9

  12. Lukasiewicz, T., Martinez, M.V., Orsi, G., Simari, G.I.: Heuristic ranking in tightly coupled probabilistic description logics. In: Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence, Catalina Island, CA, USA, 14–18 August 2012, pp. 554–563 (2012)

    Google Scholar 

  13. Lukasiewicz, T., Straccia, U.: Managing uncertainty and vagueness in description logics for the semantic web. J. Web Semant. 6(4), 291–308 (2008)

    Article  Google Scholar 

  14. Straccia, U.: Description logics with fuzzy concrete domains. arXiv preprint arXiv:1207.1410 (2012)

Download references

Acknowledgments

This work is supported by the European project H2020 Marie Sklodowska-Curie Actions (MSCA) research and Innovation Staff Exchange (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 Rym Mohamed .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Mohamed, R., Loukil, Z., Bouraoui, Z. (2018). Qualitative-Based Possibilistic \(\mathcal {EL}\) Ontology. In: Miller, T., Oren, N., Sakurai, Y., Noda, I., Savarimuthu, B.T.R., Cao Son, T. (eds) PRIMA 2018: Principles and Practice of Multi-Agent Systems. PRIMA 2018. Lecture Notes in Computer Science(), vol 11224. Springer, Cham. https://doi.org/10.1007/978-3-030-03098-8_41

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-03098-8_41

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-03097-1

  • Online ISBN: 978-3-030-03098-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics