{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:24:06Z","timestamp":1742981046191,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":40,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642331572"},{"type":"electronic","value":"9783642331589"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33158-9_2","type":"book-chapter","created":{"date-parts":[[2012,8,18]],"date-time":"2012-08-18T09:54:23Z","timestamp":1345283663000},"page":"54-77","source":"Crossref","is-referenced-by-count":8,"title":["Datalog and Its Extensions for Semantic Web Databases"],"prefix":"10.1007","author":[{"given":"Georg","family":"Gottlob","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giorgio","family":"Orsi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Pieris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mantas","family":"\u0160imkus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley (1995)"},{"issue":"3","key":"2_CR2","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1023\/A:1004275029985","volume":"27","author":"H. Andr\u00e9ka","year":"1998","unstructured":"Andr\u00e9ka, H., van Benthem, J., N\u00e9meti, I.: Modal languages and bounded fragments of predicate logic. J. of Philosophical Logic\u00a027(3), 217\u2013274 (1998)","journal-title":"J. of Philosophical Logic"},{"issue":"1","key":"2_CR3","first-page":"3","volume":"4","author":"H. Andr\u00e9ka","year":"1978","unstructured":"Andr\u00e9ka, H., N\u00e9meti, I.: The generalised completeness of Horn predicate logics as programming language. Acta Cybernetica\u00a04(1), 3\u201310 (1978)","journal-title":"Acta Cybernetica"},{"key":"2_CR4","unstructured":"Baader, F., Brandt, S., Lutz, C.: Pushing the $\\mathcal{EL}$ envelope. In: Proc. of IJCAI, pp. 364\u2013369 (2005)"},{"key":"2_CR5","unstructured":"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)"},{"key":"2_CR6","unstructured":"Baget, J.F., Lecl\u00e8re, M., Mugnier, M.L.: Walking the decidability line for rules with existential variables. In: Proc. of KR (2010)"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Beeri, C., Vardi, M.Y.: The implication problem for data dependencies. In: Proc. of ICALP, pp. 73\u201385 (1981)","DOI":"10.1007\/3-540-10843-2_7"},{"key":"2_CR8","unstructured":"Cal\u00ec, A., Gottlob, G., Kifer, M.: Taming the infinite chase: Query answering under expressive relational constraints. In: Proc. of KR, pp. 70\u201380 (2008)"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Cal\u00ec, A., Gottlob, G., Lukasiewicz, T.: A general Datalog-based framework for tractable query answering over ontologies. In: Proc. of PODS, pp. 77\u201386. ACM Press (2009)","DOI":"10.1145\/1559795.1559809"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Cal\u00ec, A., Gottlob, G., Lukasiewicz, T., Marnette, B., Pieris, A.: Datalog+\/-: A family of logical knowledge representation and query languages for new applications. In: Proc. of LICS, pp. 228\u2013242 (2010)","DOI":"10.1109\/LICS.2010.27"},{"issue":"1","key":"2_CR11","first-page":"554","volume":"3","author":"A. Cal\u00ec","year":"2010","unstructured":"Cal\u00ec, A., Gottlob, G., Pieris, A.: Advanced processing for ontological queries. PVLDB\u00a03(1), 554\u2013565 (2010)","journal-title":"PVLDB"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Cal\u00ec, A., Gottlob, G., Pieris, A.: Query answering under non-guarded rules in Datalog\u00b1. In: Proc.\u00a0of RR, pp. 175\u2013190 (2010)","DOI":"10.1007\/978-3-642-15918-3_1"},{"issue":"3","key":"2_CR13","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s10817-007-9078-x","volume":"39","author":"D. Calvanese","year":"2007","unstructured":"Calvanese, D., Giacomo, G.D., Lembo, D., Lenzerini, M., Rosati, R.: Tractable reasoning and efficient query answering in description logics: The DL-Lite family. Journal of Automated Reasoning\u00a039(3), 385\u2013429 (2007)","journal-title":"Journal of Automated Reasoning"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Ceri, S., Gottlob, G., Tanca, L.: Logic Programming and Databases. Springer (1990)","DOI":"10.1007\/978-3-642-83952-8"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Chandra, A.K., Merlin, P.M.: Optimal implementation of conjunctive queries in relational data bases. In: Proc. of STOC, pp. 77\u201390 (1977)","DOI":"10.1145\/800105.803397"},{"issue":"3","key":"2_CR16","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1137\/0214049","volume":"14","author":"A.K. Chandra","year":"1985","unstructured":"Chandra, A.K., Vardi, M.Y.: The implication problem for functional and inclusion dependencies. SIAM Journal of Computing\u00a014(3), 671\u2013677 (1985)","journal-title":"SIAM Journal of Computing"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Cosmadakis, S.S., Gaifman, H., Kanellakis, P.C., Vardi, M.Y.: Decidable optimization problems for database logic programs (preliminary report). In: Proc. of STOC, pp. 477\u2013490 (1988)","DOI":"10.1145\/62212.62259"},{"issue":"3","key":"2_CR18","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/502807.502810","volume":"33","author":"E. Dantsin","year":"2001","unstructured":"Dantsin, E., Eiter, T., Gottlob, G., Voronkov, A.: Complexity and expressive power of logic programming. ACM Computing Surveys\u00a033(3), 374\u2013425 (2001)","journal-title":"ACM Computing Surveys"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Deutsch, A., Nash, A., Remmel, J.B.: The chase revisisted. In: Proc.\u00a0of PODS, pp. 149\u2013158 (2008)","DOI":"10.1145\/1376916.1376938"},{"issue":"3","key":"2_CR20","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1145\/261124.261126","volume":"22","author":"T. Eiter","year":"1997","unstructured":"Eiter, T., Gottlob, G., Mannila, H.: Disjunctive datalog. ACM Trans. on Database Systems\u00a022(3), 364\u2013418 (1997)","journal-title":"ACM Trans. on Database Systems"},{"key":"2_CR21","series-title":"Lecture Notes in Computer Science","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"T. Eiter","year":"1997","unstructured":"Eiter, T., Leone, N., Mateis, C., Pfeifer, G., Scarcello, F.: A Deductive System for Non-Monotonic Reasoning. In: Fuhrbach, U., Dix, J., Nerode, A. (eds.) LPNMR 1997. LNCS, vol.\u00a01265, Springer, Heidelberg (1997)"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Eiter, T., Simkus, M.: FDNC: Decidable nonmonotonic disjunctive logic programs with function symbols. ACM Transactions on Computational Logic\u00a011(2) (2010)","DOI":"10.1145\/1656242.1656249"},{"issue":"1","key":"2_CR23","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.tcs.2004.10.033","volume":"336","author":"R. Fagin","year":"2005","unstructured":"Fagin, R., Kolaitis, P.G., Miller, R.J., Popa, L.: Data exchange: Semantics and query answering. Theor. Comput. Sci.\u00a0336(1), 89\u2013124 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Gaifman, H., Mairson, H.G., Sagiv, Y., Vardi, M.Y.: Undecidable optimization problems for database logic programs. J. of the ACM\u00a040(3), 683\u2013713","DOI":"10.1145\/174130.174142"},{"issue":"2","key":"2_CR25","doi-asserted-by":"crossref","first-page":"105","DOI":"10.3233\/AIC-2011-0497","volume":"24","author":"M. Gebser","year":"2011","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Schneider, M.: Potassco: The Potsdam answer set solving collection. AICOM\u00a024(2), 105\u2013124 (2011)","journal-title":"AICOM"},{"issue":"4","key":"2_CR26","doi-asserted-by":"publisher","first-page":"1719","DOI":"10.2307\/2586808","volume":"64","author":"E. Gr\u00e4del","year":"1999","unstructured":"Gr\u00e4del, E.: On the restraining power of guards. J. Symb. Log.\u00a064(4), 1719\u20131742 (1999)","journal-title":"J. Symb. Log."},{"key":"2_CR27","unstructured":"Hitzler, P., Kr\u00f6tzsch, M., Parsia, B., Patel-Schneider, P.F., Rudolph, S. (eds.): OWL\u00a02 Web Ontology Language: Primer. W3C Recommendation (October 27, 2009), http:\/\/www.w3.org\/TR\/owl2-primer\/"},{"issue":"1","key":"2_CR28","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0022-0000(84)90081-3","volume":"28","author":"D.S. Johnson","year":"1984","unstructured":"Johnson, D.S., Klug, A.C.: Testing containment of conjunctive queries under functional and inclusion dependencies. J. of Computer and System Sciences\u00a028(1), 167\u2013189 (1984)","journal-title":"J. of Computer and System Sciences"},{"key":"2_CR29","unstructured":"Kr\u00f6tzsch, M., Rudolph, S.: Extending decidable existential rules by joining acyclicity and guardedness. In: Proc.\u00a0of IJCAI, pp. 963\u2013968 (2011)"},{"key":"2_CR30","unstructured":"Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer (1993)"},{"issue":"4","key":"2_CR31","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1145\/320107.320115","volume":"4","author":"D. Maier","year":"1979","unstructured":"Maier, D., Mendelzon, A.O., Sagiv, Y.: Testing implications of data dependencies. ACM Trans. on Database Systems\u00a04(4), 455\u2013469 (1979)","journal-title":"ACM Trans. on Database Systems"},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"Marnette, B.: Generalized schema-mappings: from termination to tractability. In: Proc.\u00a0of PODS, pp. 13\u201322 (2009)","DOI":"10.1145\/1559795.1559799"},{"key":"2_CR33","unstructured":"OWL Working Group, W. OWL\u00a02 Web Ontology Language: Document Overview. W3C Recommendation (October 27, 2009), http:\/\/www.w3.org\/TR\/owl2-overview\/"},{"key":"2_CR34","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley (1994)"},{"issue":"4","key":"2_CR35","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1016\/j.websem.2007.09.004","volume":"5","author":"P.F. Patel-Schneider","year":"2007","unstructured":"Patel-Schneider, P.F., Horrocks, I.: A comparison of two modelling paradigms in the semantic web. J. Web Semantics\u00a05(4), 240\u2013250 (2007)","journal-title":"J. Web Semantics"},{"key":"2_CR36","first-page":"133","volume":"10","author":"A. Poggi","year":"2008","unstructured":"Poggi, A., Lembo, D., Calvanese, D., De Giacomo, G., Lenzerini, M., Rosati, R.: Linking data to ontologies. Journal on Data Semantics\u00a010, 133\u2013173 (2008)","journal-title":"Journal on Data Semantics"},{"key":"2_CR37","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: The complexity of relational query languages (extended abstract). In: Proc. of STOC, pp. 137\u2013146 (1982)","DOI":"10.1145\/800070.802186"},{"key":"2_CR38","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: Decidability and undecidability results for boundedness of linear recursive queries. In: Proc. of PODS, pp. 341\u2013351 (1988)","DOI":"10.1145\/308386.308470"},{"key":"2_CR39","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: Why is modal logic so robustly decidable? In: Descriptive Complexity and Finite Models, pp. 149\u2013184 (1996)","DOI":"10.1090\/dimacs\/031\/05"},{"key":"2_CR40","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: On the complexity of bounded-variable queries. In: Proc. of PODS, pp. 266\u2013276. ACM Press (May 1995)","DOI":"10.1145\/212433.212474"}],"container-title":["Lecture Notes in Computer Science","Reasoning Web. Semantic Technologies for Advanced Query Answering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33158-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,12]],"date-time":"2020-07-12T17:56:33Z","timestamp":1594576593000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33158-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642331572","9783642331589"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33158-9_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}