Skip to main content

Instance-Based Non-standard Inferences in \(\mathcal{EL}\) with Subjective Probabilities

  • Conference paper
Uncertainty Reasoning for the Semantic Web II (URSW 2010, URSW 2009, URSW 2008, UniDL 2010)

Abstract

For practical ontology-based applications representing and reasoning with probabilities is an essential task. For Description Logics with subjective probabilities reasoning procedures for testing instance relations based on the completion method have been developed.

In this paper we extend this technique to devise algorithms for solving non-standard inferences for \(\mathcal{EL}\) and its probabilistic extension Prob- \({\mathcal{EL}^{01}_c}\): computing the most specific concept of an individual and finding explanations for instance relations.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baader, F.: Least common subsumers and most specific concepts in a description logic with existential restrictions and terminological cycles. In: Gottlob, G., Walsh, T. (eds.) Proc. of the 18th Int. Joint Conf. on Artificial Intelligence, IJCAI 2003, pp. 325ā€“330. Morgan Kaufmann (2003)

    Google ScholarĀ 

  2. Baader, F., Brandt, S., Lutz, C.: Pushing the \(\mathcal{EL}\) envelope. In: Proc. of the 19th Int. Joint Conf. on Artificial Intelligence, IJCAI 2005, Edinburgh, UK. Morgan-Kaufmann Publishers (2005)

    Google ScholarĀ 

  3. Baader, F., Brandt, S., Lutz, C.: Pushing the \(\mathcal{EL}\) envelope further. In: Clark, K., Patel-Schneider, P.F. (eds.) Proc. of the OWLED Workshop (2008)

    Google ScholarĀ 

  4. Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P. (eds.): The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press (2003)

    Google ScholarĀ 

  5. Baader, F., KĆ¼sters, R., Molitor, R.: Computing least common subsumers in description logics with existential restrictions. In: Dean, T. (ed.) Proc. of the 16th Int. Joint Conf. on Artificial Intelligence, IJCAI 1999, Stockholm, Sweden, pp. 96ā€“101. Morgan Kaufmann, Los Altos (1999)

    Google ScholarĀ 

  6. Baader, F., Lutz, C., Turhan, A.-Y.: Small is again Beautiful in Description Logics. KI ā€“ KĆ¼nstliche IntelligenzĀ 24(1), 25ā€“33 (2010)

    ArticleĀ  Google ScholarĀ 

  7. Baader, F., PeƱaloza, R.: Axiom pinpointing in general tableaux. Journal of Logic and ComputationĀ 20(1), 5ā€“34 (2010); Special Issue: Tableaux and Analytic Proof Methods

    ArticleĀ  MathSciNetĀ  MATHĀ  Google ScholarĀ 

  8. Baader, F., PeƱaloza, R.: Axiom pinpointing in general tableaux. Journal of Logic and ComputationĀ 20(1), 5ā€“34 (2010); Special Issue: Tableaux and Analytic Proof Methods

    ArticleĀ  MathSciNetĀ  MATHĀ  Google ScholarĀ 

  9. Baader, F., PeƱaloza, R., Suntisrivaraporn, B.: Pinpointing in the Description Logic \({{\mathcal{EL}}^+}\). In: Hertzberg, J., Beetz, M., Englert, R. (eds.) KI 2007. LNCS (LNAI), vol.Ā 4667, pp. 52ā€“67. Springer, Heidelberg (2007)

    ChapterĀ  Google ScholarĀ 

  10. Baader, F., Suntisrivaraporn, B.: Debugging SNOMED CT using axiom pinpointing in the description logic \(\mathcal{EL}^+\). In: Proceedings of the International Conference on Representing and Sharing Knowledge Using SNOMED, KR-MED 2008, Phoenix, Arizona (2008)

    Google ScholarĀ 

  11. Bechhofer, S., van Harmelen, F., Hendler, J., Horrocks, I., McGuinness, D.L., Patel-Schneider, P.F., Stein, L.A.: OWL web ontology language reference. W3C Recommendation (February 2004), http://www.w3.org/TR/owl-ref/

  12. Kalyanpur, A., Parsia, B., Horridge, M., Sirin, E.: Finding All Justifications of OWL DL Entailments. In: Aberer, K., Choi, K.-S., Noy, N., Allemang, D., Lee, K.-I., Nixon, L.J.B., Golbeck, J., Mika, P., Maynard, D., Mizoguchi, R., Schreiber, G., CudrĆ©-Mauroux, P. (eds.) ISWC/ASWC 2007. LNCS, vol.Ā 4825, pp. 267ā€“280. Springer, Heidelberg (2007)

    ChapterĀ  Google ScholarĀ 

  13. KĆ¼sters, R., Molitor, R.: Approximating most specific concepts in description logics with existential restrictions. AI CommunicationsĀ 15(1), 47ā€“59 (2002)

    MathSciNetĀ  MATHĀ  Google ScholarĀ 

  14. Lukasiewicz, T., Straccia, U.: Managing uncertainty and vagueness in description logics for the semantic web. J. Web Sem.Ā 6(4), 291ā€“308 (2008)

    ArticleĀ  Google ScholarĀ 

  15. Lutz, C., Schrƶder, L.: Probabilistic description logics for subjective probabilities. In: Lin, F., Sattler, U. (eds.) Proc. of the 12th Int. Conf. on the Principles of Knowledge Representation and Reasoning, KR 2010 (2010)

    Google ScholarĀ 

  16. Mendez, J., Ecke, A., Turhan, A.-Y.: Implementing completion-based inferences for the \({\cal{EL}}\)-family. In: Rosati, R., Rudolph, S., Zakharyaschev, M. (eds.) Proc. of the 2011 Description Logic Workshop, DL 2011, vol.Ā 745. CEUR (2011)

    Google ScholarĀ 

  17. PeƱaloza, R., Sertkaya, B.: On the complexity of axiom pinpointing in the el family of description logics. In: Lin, F., Sattler, U., Truszczynski, M. (eds.) Proceedings of the Twelfth International Conference on Principles of Knowledge Representation and Reasoning, KR 2010. AAAI Press (2010)

    Google ScholarĀ 

  18. PeƱaloza, R., Turhan, A.-Y.: Completion-based computation of most specific concepts with limited role-depth for \(\mathcal{EL}\) and prob-\({\mathcal{EL}^{01}}\). LTCS-Report LTCS-10-03, Chair f. Automata Theory, Inst. for Theoretical Computer Science, TU Dresden, Germany (2010)

    Google ScholarĀ 

  19. PeƱaloza, R., Turhan, A.-Y.: Role-depth bounded least common subsumers by completion for \(\mathcal{EL}\)- and Prob-\({\mathcal{EL}}\)-TBoxes. In: Haarslev, V., Toman, D., Weddell, G. (eds.) Proc. of the 2010 Description Logic Workshop, DL 2010 (2010)

    Google ScholarĀ 

  20. PeƱaloza, R., Turhan, A.-Y.: Towards approximative most specific concepts by completion for \({\mathcal{EL}^{01}}\) with subjective probabilities. In: Lukasiewicz, T., PeƱaloza, R., Turhan, A.-Y. (eds.) Proceedings of the First International Workshop on Uncertainty in Description Logics, UniDL 2010 (2010)

    Google ScholarĀ 

  21. PeƱaloza, R., Turhan, A.-Y.: A Practical Approach for Computing Generalization Inferences in \(\mathcal{EL}\). In: Antoniou, G., Grobelnik, M., Simperl, E., Parsia, B., Plexousakis, D., De Leenheer, P., Pan, J. (eds.) ESWC 2011, Part I. LNCS, vol.Ā 6643, pp. 410ā€“423. Springer, Heidelberg (2011)

    ChapterĀ  Google ScholarĀ 

  22. Schlobach, S., Cornet, R.: Non-standard reasoning services for the debugging of description logic terminologies. In: Gottlob, G., Walsh, T. (eds.) Proc. of the 18th Int. Joint Conf. on Artificial Intelligence, IJCAI 2003, Acapulco, Mexico, pp. 355ā€“362. Morgan Kaufmann, Los Altos (2003)

    Google ScholarĀ 

  23. Spackman, K.: Managing clinical terminology hierarchies using algorithmic calculation of subsumption: Experience with snomed-rt. Journal of the American Medical Informatics Assoc. (2000); Fall Symposium Special Issue

    Google ScholarĀ 

  24. Springer, T., Turhan, A.-Y.: Employing description logics in ambient intelligence for modeling and reasoning about complex situations. Journal of Ambient Intelligence and Smart EnvironmentsĀ 1(3), 235ā€“259 (2009)

    Google ScholarĀ 

  25. W3C OWL Working Group. OWL 2 web ontology language document overview. W3C Recommendation (October 27, 2009), http://www.w3.org/TR/2009/REC-owl2-overview-20091027/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

Ā© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

PeƱaloza, R., Turhan, AY. (2013). Instance-Based Non-standard Inferences in \(\mathcal{EL}\) with Subjective Probabilities. In: Bobillo, F., et al. Uncertainty Reasoning for the Semantic Web II. URSW URSW URSW UniDL 2010 2009 2008 2010. Lecture Notes in Computer Science(), vol 7123. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35975-0_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35975-0_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35974-3

  • Online ISBN: 978-3-642-35975-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics