{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T20:28:56Z","timestamp":1672345736877},"reference-count":27,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2008,5,1]],"date-time":"2008-05-01T00:00:00Z","timestamp":1209600000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2008,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Recently, there has been a lot of interest in the integration of Description Logics (DL) and rules on the Semantic Web. We define<jats:italic>guarded hybrid knowledge bases<\/jats:italic>(or<jats:italic>g-hybrid knowledge bases<\/jats:italic>) as knowledge bases that consist of a Description Logic knowledge base and a<jats:italic>guarded<\/jats:italic>logic program, similar to the<jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" mimetype=\"image\" xlink:type=\"simple\" xlink:href=\"S1471068407003201_inline1\"><jats:alt-text>$\\mathcal{DL}$<\/jats:alt-text><\/jats:inline-graphic>+<jats:italic>log<\/jats:italic>knowledge bases from Rosati (<jats:italic>In Proceedings of the 10th International Conference on Principles of Knowledge Representation and Reasoning<\/jats:italic>, AAAI Press, Menlo Park, CA, 2006, pp. 68\u201378.). g-Hybrid knowledge bases enable an integration of Description Logics and Logic Programming where, unlike in other approaches, variables in the rules of a guarded program do not need to appear in positive non-DL atoms of the body, i.e., DL atoms can act as<jats:italic>guards<\/jats:italic>as well. Decidability of satisfiability checking of g-hybrid knowledge bases is shown for the particular DL<jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" mimetype=\"image\" xlink:type=\"simple\" xlink:href=\"S1471068407003201_inline2\"><jats:alt-text>$\\mathcal{DLRO}^{\\-{le}}$<\/jats:alt-text><\/jats:inline-graphic>, which is close to OWL DL, by a reduction to guarded programs under the open answer set semantics. Moreover, we show 2-<jats:sc>Exptime<\/jats:sc>-completeness for satisfiability checking of such g-hybrid knowledge bases. Finally, we discuss advantages and disadvantages of our approach compared with<jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"gif\" mimetype=\"image\" xlink:type=\"simple\" xlink:href=\"S1471068407003201_inline1\"><jats:alt-text>$\\mathcal{DL}$<\/jats:alt-text><\/jats:inline-graphic>+<jats:italic>log<\/jats:italic>knowledge bases.<\/jats:p>","DOI":"10.1017\/s1471068407003201","type":"journal-article","created":{"date-parts":[[2008,1,4]],"date-time":"2008-01-04T09:10:01Z","timestamp":1199437801000},"page":"411-429","source":"Crossref","is-referenced-by-count":12,"title":["Guarded hybrid knowledge bases"],"prefix":"10.1017","volume":"8","author":[{"given":"STIJN","family":"HEYMANS","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JOS","family":"DE BRUIJN","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"LIVIA","family":"PREDOIU","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"CRISTINA","family":"FEIER","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"DAVY","family":"VAN NIEWENBORGH","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2008,5,1]]},"reference":[{"key":"S1471068407003201_ref2","unstructured":"Calvanese D. , De Giacomo G. and Lenzerini M. 1997. Conjunctive query containment in description logics with n-ary relations. In Proc. of the 1997 Description Logic Workshop (DL'97). 5\u20139."},{"key":"S1471068407003201_ref9","unstructured":"Gelfond M. and Lifschitz V. 1988. The stable model semantics for logic programming. In Proc. of ICLP'88. MIT Press, Cambridge, MA, 1070\u20131080."},{"key":"S1471068407003201_ref11","unstructured":"Heymans S. , Van Nieuwenborgh D. , Fensel D. and Vermeir D. 2006a. Reasoning with the Description Logic $\\dlrom{}$ using Bound Guarded Programs. In Proc. of Reasoning on the Web Workshop (RoW 2006), Edinburgh, UK."},{"key":"S1471068407003201_ref26","unstructured":"Rosati R. 2006. DL+log: Tight integration of description logics and disjunctive datalog. In Proc. of the Tenth International Conference on Principles of Knowledge Representation and Reasoning (KR 2006). AAAI Press, Menlo Park, CA, 68\u201378."},{"key":"S1471068407003201_ref8","unstructured":"Eiter T. , Lukasiewicz T. , Schindlauer R. and Tompits H. 2004. Combining Answer Set Programming with DLs for the Semantic Web. In Proc. of KR 2004. 141\u2013151."},{"key":"S1471068407003201_ref22","unstructured":"Motik B. and Rosati R. 2007. A faithful integration of description logics with logic programming. In Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJCAI-07), Hyderabad, India."},{"key":"S1471068407003201_ref3","doi-asserted-by":"crossref","unstructured":"de Bruijn J. , Eiter T. , Polleres A. and Tompits H. 2006a. On representational issues about combinations of classical theories with nonmonotonic rules. In Proceedings of the First International Conference on Knowledge Science, Engineering and Management (KSEM'06). Lecture Notes in Artificial Intelligence, vol. 4092. Guilin, China. Springer-Verlag, Berlin.","DOI":"10.1007\/11811220_1"},{"key":"S1471068407003201_ref17","doi-asserted-by":"crossref","unstructured":"Horrocks I. and Patel-Schneider P. F. 2004b. A proposal for an OWL rules language. In Proc. of the Thirteenth International World Wide Web Conference (WWW 2004). ACM, New York, 723\u2013731.","DOI":"10.1145\/988672.988771"},{"key":"S1471068407003201_ref1","volume-title":"The Description Logic Handbook","author":"Baader","year":"2003"},{"key":"S1471068407003201_ref4","unstructured":"de Bruijn J. , Eiter T. , Polleres A. and Tompits H. 2007. Embedding non-ground logic programs into autoepistemic logic for knowledge-base combination. In Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJCAI-07). Hyderabad, India. AAAI Press, Menlo Park, CA."},{"key":"S1471068407003201_ref5","unstructured":"de Bruijn J. , Pearce D. , Polleres A. and Valverde A. 2006b. A logic for hybrid rules. In Proceedings of the Ontology and Rule Integration Workshop at the 2nd International Conference on Rules and Rule Markup Languages for the Semantic Web, Athens, GA."},{"key":"S1471068407003201_ref7","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008687430626"},{"key":"S1471068407003201_ref10","doi-asserted-by":"crossref","unstructured":"Gr\u00e4del E. and Walukiewicz I. 1999. Guarded fixed point logic. In Proc. of LICS '99. IEEE Computer Society, Los Alamitos, CA, 45\u201354.","DOI":"10.1109\/LICS.1999.782585"},{"key":"S1471068407003201_ref12","doi-asserted-by":"crossref","unstructured":"Heymans S. , Van Nieuwenborgh D. and Vermeir D. 2005a. Guarded Open Answer Set Programming. In LPNMR 2005. LNAI, vol. 3662. Springer-Verlag, Berlin, 92\u2013104.","DOI":"10.1007\/11546207_8"},{"key":"S1471068407003201_ref13","doi-asserted-by":"crossref","unstructured":"Heymans S. , Van Nieuwenborgh D. and Vermeir D. 2005b. Nonmonotonic ontological and rule-based reasoning with extended conceptual logic programs. In Proc. of ESWC 2005. LNCS, vol. 3532. Springer-Verlag Berlin, 392\u2013407.","DOI":"10.1007\/11431053_27"},{"key":"S1471068407003201_ref15","doi-asserted-by":"crossref","unstructured":"Heymans S. , Van Nieuwenborgh D. and Vermeir D. 2006c. Open answer set programming with guarded programs. ACM Transactions on Computational Logic (TOCL). In press.","DOI":"10.1007\/11799573_18"},{"key":"S1471068407003201_ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2004.06.003"},{"key":"S1471068407003201_ref18","unstructured":"Hustadt U. , Motik B. and Sattler U. 2004. Reducing SHIQ\u2212 description logic to disjunctive logic programs. In Proceedings of the 9th International Conference on Knowledge Representation and Reasoning KR2004, Whistler, Canada, 152\u2013162."},{"key":"S1471068407003201_ref19","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(97)10001-2"},{"key":"S1471068407003201_ref20","unstructured":"Levy A. Y. and Rousset M. 1996. CARIN: A representation language combining horn rules and description logics. In Proc. of ECAI'96. 323\u2013327."},{"key":"S1471068407003201_ref6","unstructured":"Dean M. and Schreiber G. (Eds). 2004. OWL Web Ontology Language Reference. W3C Recommendation 10 February 2004."},{"key":"S1471068407003201_ref21","doi-asserted-by":"publisher","DOI":"10.1145\/383779.383783"},{"key":"S1471068407003201_ref23","doi-asserted-by":"crossref","unstructured":"Motik B. , Sattler U. and Studer R. 2004. Query answering for OWL-DL with rules. In Proc. of ISWC 2004. LNCS, vol. 3298. Springer-Verlag, Berlin, 549\u2013563.","DOI":"10.1007\/978-3-540-30475-3_38"},{"key":"S1471068407003201_ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2005.05.002"},{"key":"S1471068407003201_ref25","doi-asserted-by":"crossref","unstructured":"Rosati R. 2005b. Semantic and computational advantages of the safe integration of ontologies and rules. In Proc. of the Third International Workshop on Principles and Practice of Semantic Web Reasoning (PPSWR 2005). LNCS, vol. 3703. Springer-Verlag, Berlin, 50\u201364.","DOI":"10.1007\/11552222_6"},{"key":"S1471068407003201_ref27","first-page":"275","volume-title":"LPNMR","author":"Swift","year":"2004"},{"key":"S1471068407003201_ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-006-9030-5"}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068407003201","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,6]],"date-time":"2019-05-06T14:36:40Z","timestamp":1557153400000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068407003201\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,5]]}},"alternative-id":["S1471068407003201"],"URL":"https:\/\/doi.org\/10.1017\/s1471068407003201","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,5]]}}}