Skip to main content
SpringerLink
Log in

Matching with Respect to General Concept Inclusions in the Description Logic \(\mathcal{EL}\)

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

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

Abstract

Matching concept descriptions against concept patterns was introduced as a new inference task in Description Logics (DLs) almost 20 years ago, motivated by applications in the Classic system. For the DL \(\mathcal{EL}\), it was shown in 2000 that matching without a TBox is NP-complete. In this paper we show that matching in \(\mathcal{EL}\) w.r.t. general TBoxes (i.e., finite sets of general concept inclusions, GCIs) is in NP by introducing a goal-oriented matching algorithm that uses non-deterministic rules to transform a given matching problem into a solved form by a polynomial number of rule applications. We also investigate some tractable variants of the matching problem w.r.t. general TBoxes.

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., Morawska, B.: Matching with respect to general concept inclusions in the description logic \(\mathcal{EL}\). LTCS-Report 14-03, Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany (2014), http://lat.inf.tu-dresden.de/research/reports.html

  2. Baader, F., Borgwardt, S., Morawska, B.: Extending unification in \(\mathcal{EL}\) towards general TBoxes. In: Proc. of the 13th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR 2012), pp. 568–572. AAAI Press (2012)

    Google Scholar 

  3. Baader, F., Borgwardt, S., Morawska, B.: A goal-oriented algorithm for unification in \(\mathcal{ELH}_{R^+}\) w.r.t. cycle-restricted ontologies. In: Thielscher, M., Zhang, D. (eds.) AI 2012. LNCS, vol. 7691, pp. 493–504. Springer, Heidelberg (2012)

    Google Scholar 

  4. Baader, F., Brandt, S., Lutz, C.: Pushing the \(\mathcal{EL}\) envelope. In: Kaelbling, L.P., Saffiotti, A. (eds.) Proc. of the 19th Int. Joint Conf. on Artificial Intelligence (IJCAI 2005), pp. 364–369. Morgan Kaufmann, Los Altos (2005)

    Google Scholar 

  5. Baader, F., Küsters, R.: Matching in description logics with existential restrictions. In: Proc. of the 7th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR 2000), pp. 261–272 (2000)

    Google Scholar 

  6. Baader, F., Küsters, R., Borgida, A., McGuinness, D.L.: Matching in description logics. J. of Logic and Computation 9(3), 411–447 (1999)

    Article  MATH  Google Scholar 

  7. Baader, F., Morawska, B.: Unification in the description logic \(\mathcal{EL}\). Logical Methods in Computer Science 6(3) (2010)

    Google Scholar 

  8. Baader, F., Narendran, P.: Unification of concept terms in description logics. J. of Symbolic Computation 31(3), 277–305 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  9. Borgida, A., Brachman, R.J., McGuinness, D.L., Alperin Resnick, L.: CLASSIC: A structural data model for objects. In: Proc. of the ACM SIGMOD Int. Conf. on Management of Data, pp. 59–67 (1989)

    Google Scholar 

  10. Borgida, A., Küsters, R.: What’s not in a name? Initial explorations of a structural approach to integrating large concept knowledge-bases. Tech. Rep. DCS-TR-391, Rutgers University (1999)

    Google Scholar 

  11. Borgida, A., McGuinness, D.L.: Asking queries about frames. In: Proc. of the 5th Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR 1996), pp. 340–349 (1996)

    Google Scholar 

  12. Brandt, S.: Polynomial time reasoning in a description logic with existential restrictions, GCI axioms, and—what else? In: de Mántaras, R.L., Saitta, L. (eds.) Proc. of the 16th Eur. Conf. on Artificial Intelligence (ECAI 2004), pp. 298–302 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Theoretical Computer Science, TU Dresden, Germany

    Franz Baader & Barbara Morawska

Authors
  1. Franz Baader
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Barbara Morawska
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Universität Bremen, Germany

    Carsten Lutz

  2. University of New South Wales, 2052, Sydney, NSW, Australia

    Michael Thielscher

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Baader, F., Morawska, B. (2014). Matching with Respect to General Concept Inclusions in the Description Logic \(\mathcal{EL}\) . In: Lutz, C., Thielscher, M. (eds) KI 2014: Advances in Artificial Intelligence. KI 2014. Lecture Notes in Computer Science(), vol 8736. Springer, Cham. https://doi.org/10.1007/978-3-319-11206-0_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11206-0_14

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11205-3

  • Online ISBN: 978-3-319-11206-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation