Abstract
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. Although several decidable fragments of OASP have been identified, few reasoning procedures exist. In this paper, we provide a sound, complete, and terminating algorithm for satisfiability checking w.r.t. forest logic programs, a fragment where rules have a tree shape and allow for inequality atoms and constants. We further introduce f-hybrid knowledge bases, a hybrid framework where \(\mathcal SHOQ\) knowledge bases and forest logic programs co-exist, and we show that reasoning with such knowledge bases can be reduced to reasoning with forest logic programs only. We note that f-hybrid knowledge bases do not require the usual (weakly) DL-safety of the rule component, providing thus a genuine alternative approach to hybrid reasoning.
This work is partially supported by the Austrian Science Fund (FWF) under the projects P20305 and P20840, and by the European Commission under the project OntoRule (IST-2009-231875).
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F. (eds.): The DL Handbook: Theory, Implementation, and Applications (2003)
Donini, F., Lenzerini, M., Nardi, D., Schaerf, A.: AL-log: Integrating Datalog and Description Logics. J. of Intelligent and Cooperative Information Systems 10, 227–252 (1998)
Eiter, T., Ianni, G., Lukasiewicz, T., Schindlauer, R., Tompits, H.: Combining answer set programming with description logics for the semantic web. Artificial Intelligence 172(12-13), 1495–1539 (2008)
Feier, C., Heymans, S.: Hybrid reasoning with forest logic programs. Technical Report Infsys Research Report 184-08-14, KBS Group, Vienna University of Technology, Austria (December 2008), www.kr.tuwien.ac.at/staff/heymans/priv/projects/fwf-doasp/eswc2009-tr.pdf
Feier, C., Heymans, S.: A sound and complete algorithm for simple conceptual logic programs. In: Proc. of ALPSWS 2008 (2008)
Gelfond, M., Lifschitz, V.: The Stable Model Semantics for Logic Programming. In: Proc. of ICLP 1988, pp. 1070–1080 (1988)
Grosof, B.N., Horrocks, I., Volz, R., Decker, S.: Description logic programs: combining logic programs with description logic. In: Proc. of the World Wide Web Conference (WWW), pp. 48–57 (2003)
Heymans, S., de Bruijn, J., Predoiu, L., Feier, C., Van Nieuwenborgh, D.: Guarded hybrid knowledge bases. TPLP 8(3), 411–429 (2008)
Heymans, S., Van Nieuwenborgh, D., Vermeir, D.: Conceptual logic programs. Annals of Mathematics and Artificial Intelligence (Special Issue on Answer Set Programming) 47(1–2), 103–137 (2006)
Heymans, S., Van Nieuwenborgh, D., Vermeir, D.: Open answer set programming for the semantic web. J. of Applied Logic 5(1), 144–169 (2007)
Heymans, S., Van Nieuwenborgh, D., Vermeir, D.: Open answer set programming with guarded programs. ACM Trans. on Comp. Logic 9(4) (October 2008)
Horrocks, I., Patel-Schneider, P.F.: A proposal for an OWL rules language. In: Proc. of the World Wide Web Conference (WWW), pp. 723–731. ACM, New York (2004)
Krötzsch, M., Rudolph, S., Hitzler, P.: Description logic rules. In: Proc. 18th European Conf. on Artificial Intelligence (ECAI 2008), pp. 80–84 (2008)
Levy, A.Y., Rousset, M.: CARIN: A Representation Language Combining Horn Rules and Description Logics. In: Proc. of ECAI 1996, pp. 323–327 (1996)
Motik, B., Horrocks, I., Rosati, R., Sattler, U.: Can OWL and logic programming live together happily ever after? In: Cruz, I., Decker, S., Allemang, D., Preist, C., Schwabe, D., Mika, P., Uschold, M., Aroyo, L.M. (eds.) ISWC 2006. LNCS, vol. 4273, pp. 501–514. Springer, Heidelberg (2006)
Motik, B., Rosati, R.: Closing Semantic Web Ontologies. Technical report (2006)
Motik, B., Sattler, U., Studer, R.: Query answering for OWL-DL with rules. Journal of Web Semantics 3(1), 41–60 (2005)
Rosati, R.: On the decidability and complexity of integrating ontologies and rules. Web Semantics 3(1), 41–60 (2005)
Rosati, R.: DL+log: Tight integration of description logics and disjunctive datalog. In: Proc. of the Int. Conf. on Principles of KR and Reas (KR), pp. 68–78 (2006)
Rosat, R.: On combining description logic ontologies and nonrecursive datalog rules. In: Proc. of the 2nd Int. Conf. on Web Reasoning and Rule Systems (2008)
Smith, M., Welty, C., McGuinness, D.: OWL Web Ontology Language Guide (2004), http://www.w3.org/TR/owl-guide/
Tobies, S.: Complexity Results and Practical Algorithms for Logics in Knowledge Representation. PhD thesis, RWTH-Aachen (2001)
Vardi, M.Y.: Reasoning about the past with two-way automata. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, p. 628. Springer, Heidelberg (1998)
Šimkus, M., Eiter, T.: \(\mathbb{FDNC}\): Decidable non-monotonic disjunctive logic programs with function symbols. In: Dershowitz, N., Voronkov, A. (eds.) LPAR 2007. LNCS, vol. 4790, pp. 514–530. Springer, Heidelberg (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Feier, C., Heymans, S. (2009). Hybrid Reasoning with Forest Logic Programs. In: Aroyo, L., et al. The Semantic Web: Research and Applications. ESWC 2009. Lecture Notes in Computer Science, vol 5554. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02121-3_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-02121-3_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02120-6
Online ISBN: 978-3-642-02121-3
eBook Packages: Computer ScienceComputer Science (R0)