Skip to main content

Semantic Independence in DL-Programs

  • Conference paper
Web Reasoning and Rule Systems (RR 2012)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7497))

Included in the following conference series:

Abstract

Description Logic programs (DL-programs) are a prominent approach for a loose coupling of rules and ontologies, which has become a topic of increased interest. When computing answer sets of a DL-program, special DL-atoms, which provide query interface to an ontology, are evaluated under a possibly changing input that gives a context for the evaluation. Many different such contexts may exist and evaluating a DL-atom may be costly even for one context. Thus a natural question to ask is when the evaluation is independent of the context. Such information has immediate applications in optimization of DL-programs, but is also beneficial for other reasoning tasks, like inconsistency diagnosis and program repair. We provide an answer to this question based on a semantic notion of independence and provide a complete characterization of independent DL-atoms. We then extend the characterization to independence under additional information about inclusions among rule predicates. Moreover, we develop an axiomatization which allows one to derive all tautological DL-atoms in the general case and under predicate inclusions. A complexity analysis reveals that checking whether a DL-atom is independent, can be done efficiently.

This work is partially supported by the Austrian Science Fund (FWF) project P20840, and by the EC FP7 project OntoRule (IST-2009-231875).

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., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation and Applications. Cambridge University Press (2003)

    Google Scholar 

  2. Dao-Tran, M., Eiter, T., Krennwallner, T.: Realizing Default Logic over Description Logic Knowledge Bases. In: Sossai, C., Chemello, G. (eds.) ECSQARU 2009. LNCS, vol. 5590, pp. 602–613. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

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

  4. Eiter, T., Ianni, G., Lukasiewicz, T., Schindlauer, R., Tompits, H.: Combining answer set programming with description logics for the Semantic Web. AI 172, 1495–1539 (2008)

    MathSciNet  MATH  Google Scholar 

  5. Eiter, T., Fink, M., Stepanova, D.: Semantic independence in DL-programs. Tech. Rep. INFSYS RR-1843-12-07, Institut für Informationssysteme, Technische Universität Wien, A-1040 Vienna, Austria (2012)

    Google Scholar 

  6. Eiter, T., Ianni, G., Krennwallner, T., Schindlauer, R.: Exploiting conjunctive queries in description logic programs. Ann. Math. Artif. Intell. 53(1-4), 115–152 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  7. Eiter, T., Ianni, G., Schindlauer, R., Tompits, H.: Nonmonotonic Description Logic Programs: Implementation and Experiments. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS (LNAI), vol. 3452, pp. 511–527. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  8. Fink, M., El Ghali, A., Chniti, A., Korf, R., Schwichtenberg, A., Lévy, F., Pührer, J., Eiter, T.: D2.6 Consistency maintenance. Tech. Rep. 2.6, ONTORULE ICT-2009-231875 Project (2011), http://ontorule-project.eu/outcomes?func=fileinfo&id=92

  9. Fink, M., Pearce, D.: A Logical Semantics for Description Logic Programs. In: Janhunen, T., Niemelä, I. (eds.) JELIA 2010. LNCS, vol. 6341, pp. 156–168. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  10. Heymans, S., Korf, R., Erdmann, M., Pührer, J., Eiter, T.: Loosely coupling F-logic rules and ontologies. In: Int’l Conf. on Web Intelligence (WI 2010), pp. 248–255. IEEE CS (2010)

    Google Scholar 

  11. Horrocks, I., Patel-Schneider, P.F.: Reducing OWL entailment to description logic satisfiability. Journal of Web Semantics 1(4), 345–357 (2004)

    Article  Google Scholar 

  12. Horrocks, I., Patel-Schneider, P.F., van Harmelen, F.: From \(\mathcal{SHIQ}\) and RDF to OWL: The making of a Web ontology language. Journal of Web Semantics 1(1), 7–26 (2003)

    Article  Google Scholar 

  13. Lukasiewicz, T.: A novel combination of answer set programming with description logics for the semantic web. IEEE Trans. Knowl. Data Eng. 22(11), 1577–1592 (2010)

    Article  Google Scholar 

  14. Motik, B., Patel-Schneider, P.F., Parsia, B. (eds.): OWL 2 Web Ontology Language: Structural Specification and Functional-Style Syntax (2008), w3C Working Draft (April 2009)

    Google Scholar 

  15. Motik, B., Rosati, R.: Reconciling Description Logics and Rules. JACM 57(5), 1–62 (2010)

    Article  MathSciNet  Google Scholar 

  16. Pührer, J., Heymans, S., Eiter, T.: Dealing with Inconsistency When Combining Ontologies and Rules Using DL-Programs. In: Aroyo, L., Antoniou, G., Hyvönen, E., ten Teije, A., Stuckenschmidt, H., Cabral, L., Tudorache, T. (eds.) ESWC 2010. LNCS, vol. 6088, pp. 183–197. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  17. Shen, Y.D.: Well-supported semantics for description logic programs. In: Proc. IJCAI 2011, pp. 1081–1086. AAAI Press (2011)

    Google Scholar 

  18. Wang, K., Billington, D., Blee, J., Antoniou, G.: Combining Description Logic and Defeasible Logic for the Semantic Web. In: Antoniou, G., Boley, H. (eds.) RuleML 2004. LNCS, vol. 3323, pp. 170–181. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  19. Wang, Y., You, J.H., Yuan, L.Y., Shen, Y.D.: Loop formulas for description logic programs. Theory and Practice of Logic Progamming 10(4-6), 531–545 (2010)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Eiter, T., Fink, M., Stepanova, D. (2012). Semantic Independence in DL-Programs. In: Krötzsch, M., Straccia, U. (eds) Web Reasoning and Rule Systems. RR 2012. Lecture Notes in Computer Science, vol 7497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33203-6_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33203-6_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33202-9

  • Online ISBN: 978-3-642-33203-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics