Skip to main content

The DReW System for Nonmonotonic DL-Programs

  • Conference paper
  • First Online:
Semantic Web and Web Science

Part of the book series: Springer Proceedings in Complexity ((SPCOM))

Abstract

Nonmonotonic DL-programs provide a loose integration of Description Logic (DL) ontologies and Logic Programming (LP) rules with negation, where a rule engine can query an ontology with a native DL reasoner. However, in most systems for DL-programs, the overhead of an external DL reasoner might be considerable. Datalog-rewritable DL ontologies, such as most fragments of OWL 2 RL, OWL 2 EL, and OWL 2 QL, can be rewritten to Datalog programs, so that DL-programs can be reduced to Datalog ¬ , i.e., Datalog with negation, under both well-founded and answer set semantics. We developed the reasoner DReW that uses the Datalog-rewriting technique. In addition to DL-programs, DReW can also answer conjunctive queries under DL-safeness conditions over Datalog-rewritable ontologies as well as reason on terminological default logics over such ontologies.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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.

    http://www.kr.tuwien.ac.at/research/systems/drew.

  2. 2.

    http://owlapi.sourceforge.net/.

  3. 3.

    http://www.dlvsystem.com/dlv/.

References

  1. Artale, A., Calvanese, D., Kontchakov, R., Zakharyaschev, M.: The DL-Lite family and relations. J. Artif. Intell. Res. 36, 1–69 (2009)

    MathSciNet  MATH  Google Scholar 

  2. Baader, F., Hollunder, B.: Embedding defaults into terminological knowledge representation formalisms. J. Autom. Reason. 14(1), 149–180 (1995)

    Article  MathSciNet  Google Scholar 

  3. Drabent, W., Eiter, T., Ianni, G., Krennwallner, T., Lukasiewicz, T., Maluszynski, J.: Hybrid reasoning with rules and ontologies. In: Bry, F., Maluszynski, J. (eds.) REWERSE, vol. 5500 of Lecture Notes in Computer Science, pp. 1–49. Springer, New York (2009)

    Google Scholar 

  4. Eiter, T., Ianni, G., Lukasiewicz, T., Schindlauer, R.: Well-founded semantics for description logic programs in the Semantic Web. ACM Trans. Comput. Log. 12(2), 11 (2011)

    Article  MathSciNet  Google Scholar 

  5. Eiter, T., Ianni, G., Lukasiewicz, T., Schindlauer, R., Tompits, H.: Combining answer set programming with description logics for the semantic web. Artif. Intell. 172(12–13), 1495–1539 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  6. Eiter, T., Ortiz, M., Simkus, M., Tran, T., Xiao, G.: Query rewriting for Horn-SHIQ plus rules. In: Proc. of AAAI 2012. AAAI, Toronto, Canada (2012)

    Google Scholar 

  7. Eiter, T., Krennwallner, T., Schneider, P., Xiao, G.: Uniform evaluation of nonmonotonic DL-programs. In: FoIKS’12, pp. 1–22. Springer, New York (2012)

    Google Scholar 

  8. Heymans, S., Eiter, T., Xiao, G.: Tractable reasoning with DL-programs over datalog-rewritable description logics. In: Proc. of ECAI 2010. IOS Press, Lisbon, Portugal (2010)

    Google Scholar 

  9. Krötzsch, M.: Efficient inferencing for OWL EL. In: JELIA, LNCS, vol. 6341, pp. 234-246, 2010

    Google Scholar 

  10. Motik, B., Sattler, U., Studer, R.: Query answering for OWL-DL with rules. J. Web Semant. 3(1), 41–60 (2005)

    Article  Google Scholar 

  11. Wang, Y., You, J.-H., Yuan, L.-Y., Shen, Y.-D., Zhang, M.: The loop formula based semantics of description logic programs. Theor. Comput. Sci. 415, 60–85 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  12. Xiao, G., Heymans, S., Eiter, T.: DReW: a reasoner for datalog-rewritable description logics and dl-programs. In: Informal Proc. 1st Int’l Workshop on Business Models, Business Rules and Ontologies (BuRO 2010), 2010

    Google Scholar 

Download references

Acknowledgements

This work has been partially supported by the Austrian Science Fund (FWF) project P20840 and EU Project OntoRule (FP7 231875).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Guohui Xiao .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media New York

About this paper

Cite this paper

Xiao, G., Eiter, T., Heymans, S. (2013). The DReW System for Nonmonotonic DL-Programs. In: Li, J., Qi, G., Zhao, D., Nejdl, W., Zheng, HT. (eds) Semantic Web and Web Science. Springer Proceedings in Complexity. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-6880-6_33

Download citation

  • DOI: https://doi.org/10.1007/978-1-4614-6880-6_33

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4614-6879-0

  • Online ISBN: 978-1-4614-6880-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics