Skip to main content

Combining Description Logics, Description Graphs, and Rules

  • Conference paper
Frontiers of Combining Systems (FroCoS 2009)

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

Included in the following conference series:

Abstract

Recent practical experience with description logics (DLs) has revealed that their expressivity is often insufficient to accurately describe structured objects—objects whose parts are interconnected in arbitrary, rather than tree-like ways. To address this problem, we propose an extension of DL languages with description graphs—a modeling construct that can accurately describe objects whose parts are connected in arbitrary ways. Furthermore, to enable modeling the conditional aspects of structured objects, we also incorporate rules into our formalism. We present an in-depth study of the computational properties of such a formalism. In particular, we first identify the sources of undecidability of the general, unrestricted formalism, and then present a restriction that makes reasoning decidable. Finally, we present tight complexity bounds.

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. Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison Wesley, Reading (1995)

    MATH  Google Scholar 

  2. Andréka, H., van Benthem, J., Németi, I.: Modal Languages and Bounded Fragments of Predicate Logic. Journal of Philosophical Logic 27(3), 217–274 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  3. Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation and Applications, 2nd edn. Cambridge University Press, Cambridge (2007)

    MATH  Google Scholar 

  4. Baader, F., Sattler, U.: An Overview of Tableau Algorithms for Description Logics. Studia Logica 69, 5–40 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  5. Börger, E., Grädel, E., Gurevich, Y.: The Classical Decision Problem. Springer, Heidelberg (1996)

    MATH  Google Scholar 

  6. Borgida, A.: On the Relative Expressiveness of Description Logics and Predicate Logics. Artificial Intelligence 82(1-2), 353–367 (1996)

    Article  MathSciNet  Google Scholar 

  7. Calì, A., Gottlob, G., Kifer, M.: Taming the Infinite Chase: Query Answering under Expressive Relational Constraints. In: Proc. KR 2008, Sydney, NSW, Australia, pp. 70–80 (2008)

    Google Scholar 

  8. Grau, B.C., Horrocks, I., Motik, B., Parsia, B., Patel-Schneider, P., Sattler, U.: OWL 2: The next step for OWL. Journal of Web Semantics 6(4), 309–322 (2008)

    Article  Google Scholar 

  9. Dantsin, E., Eiter, T., Gottlob, G., Voronkov, A.: Complexity and expressive power of logic programming. ACM Computing Surveys 33(3), 374–425 (2001)

    Article  Google Scholar 

  10. de Bruijn, J., Polleres, A., Lara, R., Fensel, D.: OWL DL vs. OWL Flight: Conceptual Modeling and Reasoning on the Semantic Web. In: Proc. WWW 2005, Chiba, Japan, pp. 623–632 (2005)

    Google Scholar 

  11. Donini, F.M., Lenzerini, M., Nardi, D., Schaerf, A.: AL-log: Integrating Datalog and Description Logics. Journal of Intelligent Information Systems 10(3), 227–252 (1998)

    Article  MATH  Google Scholar 

  12. Eiter, T., Lukasiewicz, T., Schindlauer, R., Tompits, H.: Combining Answer Set Programming with Description Logics for the Semantic Web. In: Proc. KR 2004, Whistler, Canada, pp. 141–151 (2004)

    Google Scholar 

  13. Horrocks, I., Patel-Schneider, P.F.: A Proposal for an OWL Rules Language. In: Proc. WWW 2004, New York, NY, USA, pp. 723–731 (2004)

    Google Scholar 

  14. Horrocks, I., Sattler, U.: A Tableau Decision Procedure for \(\mathcal{SHOIQ}\). Journal of Automated Reasoning 39(3), 249–276 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  15. Kifer, M., Lausen, G., Wu, J.: Logical foundations of object-oriented and frame-based languages. Journal of the ACM 42(4), 741–843 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  16. Kutz, O., Horrocks, I., Sattler, U.: The Even More Irresistible \(\mathcal{SROIQ}\). In: Proc. KR 2006, Lake District, UK, pp. 68–78 (2006)

    Google Scholar 

  17. Levy, A.Y., Rousset, M.-C.: Combining Horn Rules and Description Logics in CARIN. Artificial Intelligence 104(1-2), 165–209 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  18. Motik, B.: Reasoning in Description Logics using Resolution and Deductive Databases. PhD thesis, Univesität Karlsruhe, Germany (2006)

    Google Scholar 

  19. Motik, B., Cuenca Grau, B., Sattler, U.: Structured Objects in OWL: Representation and Reasoning. In: Proc. WWW 2008, Beijing, China (2008)

    Google Scholar 

  20. Motik, B., Rosati, R.: A Faithful Integration of Description Logics with Logic Programming. In: Proc. IJCAI 2007, Hyderabad, India, pp. 477–482 (2007)

    Google Scholar 

  21. Motik, B., Shearer, R., Horrocks, I.: Hypertableau Reasoning for Description Logics. Technical report, University of Oxford (2008); Submitted to an international journal

    Google Scholar 

  22. Motik, B., Grau, B.C., Horrocks, I., Sattler, U.: Representing Ontologies Using Description Logics, Description Graphs, and Rules (2009); Submitted to a journal

    Google Scholar 

  23. Motik, B., Sattler, U., Studer, R.: Query Answering for OWL-DL with Rules. Journal of Web Semantics 3(1), 41–60 (2005)

    Article  Google Scholar 

  24. Mylopoulos, J., Borgida, A., Jarke, M., Koubarakis, M.: Telos: Representing Knowledge about Information Systems. ACM Transactions of Information Systems 8(4), 325–362 (1990)

    Article  Google Scholar 

  25. Patel-Schneider, P.F., Hayes, P., Horrocks, I.: OWL Web Ontology Language: Semantics and Abstract Syntax, W3C Recommendation, February 10 (2004), http://www.w3.org/TR/owl-semantics/

  26. Plaisted, D.A., Greenbaum, S.: A Structure-Preserving Clause Form Translation. Journal of Symbolic Logic and Computation 2(3), 293–304 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  27. Rosati, R.: \(\mathcal{DL}{+}log\): A Tight Integration of Description Logics and Disjunctive Datalog. In: Proc. KR 2006, Lake District, UK, pp. 68–78 (2006)

    Google Scholar 

  28. Schmidt, R.A., Hustadt, U.: A Principle for Incorporating Axioms into the First-Order Translation of Modal Formulae. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol. 2741, pp. 412–426. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  29. Tobies, S.: Complexity Results and Practical Algorithms for Logics in Knowledge Representation. PhD thesis, RWTH Aachen, Germany (2001)

    Google Scholar 

  30. Vardi, M.Y.: Why Is Modal Logic So Robustly Decidable? In: Proc. of a DIMACS Workshop on Descriptive Complexity and Finite Models, pp. 149–184 (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Motik, B. (2009). Combining Description Logics, Description Graphs, and Rules. In: Ghilardi, S., Sebastiani, R. (eds) Frontiers of Combining Systems. FroCoS 2009. Lecture Notes in Computer Science(), vol 5749. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04222-5_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04222-5_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04221-8

  • Online ISBN: 978-3-642-04222-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics