Skip to main content
SpringerLink
Log in

Linkless Normal Form for \(\mathcal{ALC}\) Concepts and TBoxes

  • Conference paper
KI 2011: Advances in Artificial Intelligence (KI 2011)

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

Included in the following conference series:

  • 1610 Accesses

Abstract

In this paper we introduce a normal form for \(\mathcal{ALC}\) concepts and TBoxes called linkless normal form. We investigate properties of concepts given in this normal form such as an efficient satisfiability test and the calculation of uniform interpolants. We further show a way to approximate a TBox by a concept in linkless normal form, which allows us to check certain subsumptions efficiently. This makes the linkless normal form interesting from the viewpoint of knowledge compilation. Furthermore, we show how to use the approximation of a TBox in linkless normal form to efficiently construct an approximation of a uniform interpolant of a TBox w.r.t. a given signature.

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

Access this chapter

Log in via an institution
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., Küsters, R., Molitor, R.: Computing least common subsumers in description logics with existential restrictions. In: Dean, T. (ed.) IJCAI, pp. 96–103. Morgan Kaufmann, San Francisco (1999)

    Google Scholar 

  2. Baader, F., Nutt, W.: Basic description logics. In: Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P. (eds.) [3], pp. 43–95

    Google Scholar 

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

    MATH  Google Scholar 

  4. Balsiger, P., Heuerding, A.: Comparison of theorem provers for modal logics - introduction and summary. In: de Swart, H. (ed.) TABLEAUX 1998. LNCS (LNAI), vol. 1397, pp. 25–26. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  5. Bienvenu, M.: Prime implicates and prime implicants in modal logic. In: Proceedings of the Twenty-Second Conference on Artificial Intelligence (AAAI 2007), pp. 397–384 (2007)

    Google Scholar 

  6. Darwiche, A.: Decomposable negation normal form. Journal of the ACM, 48(4) (2001)

    Google Scholar 

  7. Darwiche, A., Marquis, P.: A knowledge compilation map. Journal of Artificial Intelligence Research 17, 229–264 (2002)

    MathSciNet  MATH  Google Scholar 

  8. Furbach, U., Günther, H., Obermaier, C.: A knowledge compilation technique for ALC TBoxes. In: Lane, C., Guesgen, H. (eds.) FLAIRS Conference. AAAI Press, Menlo Park (2009)

    Google Scholar 

  9. Furbach, U., Obermaier, C.: Precompiling ALC Tboxes and query answering. In: Proceedings of the 4th Workshop on Contexts and Ontologies (2008)

    Google Scholar 

  10. Horrocks, I.: Implementation and optimization techniques. In: Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P. (eds.) [3], pp. 306–346

    Google Scholar 

  11. Konev, B., Walther, D., Wolter, F.: Forgetting and uniform interpolation in large-scale description logic terminologies. In: Boutilier, C. (ed.) IJCAI, pp. 830–835 (2009)

    Google Scholar 

  12. Kracht, M.: Tools and techniques in Modal Logic. Elsevier Science, Amsterdam (1999)

    MATH  Google Scholar 

  13. Murray, N., Rosenthal, E.: Tableaux, path dissolution, and decomposable negation normal form for knowledge compilation. In: Cialdea Mayer, M., Pirri, F. (eds.) TABLEAUX 2003. LNCS, vol. 2796, pp. 165–180. Springer, Heidelberg (2003)

    Google Scholar 

  14. Murray, N., Rosenthal, E.: Dissolution: Making paths vanish. Journal of the ACM 40(3), 504–535 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  15. Schon, C.: Linkless normal form for ALC concepts. Reports of the Faculty of Informatics 12/2010, Universität Koblenz-Landau (2010), http://www.uni-koblenz.de/FB4/Publications/Reports

  16. Selman, B., Kautz, H.: Knowledge compilation and theory approximation. J. ACM 43(2), 193–224 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  17. ten Cate, B., Conradie, W., Marx, M., Venema, Y.: Definitorially complete description logics. In: Doherty, P., Mylopoulos, J., Welty, C. (eds.) Proc. of KR 2006, pp. 79–89. AAAI Press, Menlo Park (2006)

    Google Scholar 

  18. Tsarkov, D., Horrocks, I.: Fact++ description logic reasoner: System description. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 292–297. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  19. Wang, K., Wang, Z., Topor, R., Pan, J., Antoniou, G.: Concept and role forgetting in ALC ontologies. In: Bernstein, A., Karger, D.R., Heath, T., Feigenbaum, L., Maynard, D., Motta, E., Thirunarayan, K. (eds.) ISWC 2009. LNCS, vol. 5823, pp. 666–681. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Koblenz-Landau, Germany

    Claudia Schon

Authors
  1. Claudia Schon
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Berlin School of Mind and Brain, Humboldt-University of Berlin, Unter den Linden 6, 10099, Berlin, Germany

    Joscha Bach

  2. TZI-Technologie-Zentrum Informatik und Informationstechnik, University of Bremen, Postfach 33 04 40, 28334, Bremen, Germany

    Stefan Edelkamp

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schon, C. (2011). Linkless Normal Form for \(\mathcal{ALC}\) Concepts and TBoxes. In: Bach, J., Edelkamp, S. (eds) KI 2011: Advances in Artificial Intelligence. KI 2011. Lecture Notes in Computer Science(), vol 7006. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24455-1_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24455-1_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24454-4

  • Online ISBN: 978-3-642-24455-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation