{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T08:43:09Z","timestamp":1725698589153},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642325885"},{"type":"electronic","value":"9783642325892"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32589-2_1","type":"book-chapter","created":{"date-parts":[[2012,8,1]],"date-time":"2012-08-01T08:44:32Z","timestamp":1343810672000},"page":"1-18","source":"Crossref","is-referenced-by-count":9,"title":["On the Complexity of Ontological Reasoning under Disjunctive Existential Rules"],"prefix":"10.1007","author":[{"given":"Georg","family":"Gottlob","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Manna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Morak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Pieris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley (1995)"},{"key":"1_CR2","unstructured":"Alviano, M., Faber, W., Leone, N., Manna, M.: Disjunctive Datalog with existential quantifiers: Semantics, decidability, and complexity issues. In: TPLP (to appear, 2012)"},{"issue":"3","key":"1_CR3","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1023\/A:1004275029985","volume":"27","author":"H. Andr\u00e9ka","year":"1998","unstructured":"Andr\u00e9ka, H., N\u00e9meti, I., van Benthem, J.: Modal languages and bounded fragments of predicate logic. J. Philosophical Logic\u00a027(3), 217\u2013274 (1998)","journal-title":"J. Philosophical Logic"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Baader, F.: Least common subsumers and most specific concepts in a description logic with existential restrictions and terminological cycles. In: Proc. of IJCAI, pp. 319\u2013324 (2003)","DOI":"10.25368\/2022.125"},{"key":"1_CR5","unstructured":"Baader, F., Brandt, S., Lutz, C.: Pushing the $\\mathcal{EL}$ envelope. In: Proc.\u00a0of IJCAI, pp. 364\u2013369 (2005)"},{"key":"1_CR6","unstructured":"Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F.: The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press (2003)"},{"issue":"9-10","key":"1_CR7","doi-asserted-by":"publisher","first-page":"1620","DOI":"10.1016\/j.artint.2011.03.002","volume":"175","author":"J.-F. Baget","year":"2011","unstructured":"Baget, J.-F., Lecl\u00e8re, M., Mugnier, M.-L., Salvat, E.: On rules with existential variables: Walking the decidability line. Artif. Intell.\u00a0175(9-10), 1620\u20131654 (2011)","journal-title":"Artif. Intell."},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"B\u00e1r\u00e1ny, V., Gottlob, G., Otto, M.: Querying the guarded fragment. In: Proc.\u00a0of LICS, pp. 1\u201310 (2010)","DOI":"10.1109\/LICS.2010.26"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/3-540-10843-2_7","volume-title":"Automata, Languages and Programming","author":"C. Beeri","year":"1981","unstructured":"Beeri, C., Vardi, M.Y.: The Implication Problem for Data Dependencies. In: Even, S., Kariv, O. (eds.) ICALP 1981. LNCS, vol.\u00a0115, pp. 73\u201385. Springer, Heidelberg (1981)"},{"issue":"1-2","key":"1_CR10","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.artint.2005.05.003","volume":"168","author":"D. Berardi","year":"2005","unstructured":"Berardi, D., Calvanese, D., Giacomo, G.D.: Reasoning on UML class diagrams. Artif. Intell.\u00a0168(1-2), 70\u2013118 (2005)","journal-title":"Artif. Intell."},{"issue":"1","key":"1_CR11","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1006\/inco.1998.2734","volume":"147","author":"L. Cabibbo","year":"1998","unstructured":"Cabibbo, L.: The expressive power of stratified logic programs with value invention. Inf. Comput.\u00a0147(1), 22\u201356 (1998)","journal-title":"Inf. Comput."},{"key":"1_CR12","unstructured":"Cal\u00ec, A., Gottlob, G., Kifer, M.: Taming the infinite chase: Query answering under expressive relational constraints. In: Proc.\u00a0of KR, pp. 70\u201380 (2008)"},{"key":"1_CR13","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.\u00a0of PODS, pp. 77\u201386 (2009)","DOI":"10.1145\/1559795.1559809"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Cal\u00ec, A., Gottlob, G., Lukasiewicz, T., Marnette, B., Pieris, A.: Datalog\u00b1: A family of logical knowledge representation and query languages for new applications. In: Proc.\u00a0of LICS, pp. 228\u2013242 (2010)","DOI":"10.1109\/LICS.2010.27"},{"issue":"1","key":"1_CR15","first-page":"554","volume":"3","author":"A. Cal\u00ec","year":"2010","unstructured":"Cal\u00ec, A., Gottlob, G., Pieris, A.: Advanced processing for ontological queries. VLDB\u00a03(1), 554\u2013565 (2010)","journal-title":"VLDB"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-15918-3_1","volume-title":"Web Reasoning and Rule Systems","author":"A. Cal\u00ec","year":"2010","unstructured":"Cal\u00ec, A., Gottlob, G., Pieris, A.: Query Answering under Non-guarded Rules in Datalog\u00b1. In: Hitzler, P., Lukasiewicz, T. (eds.) RR 2010. LNCS, vol.\u00a06333, pp. 1\u201317. Springer, Heidelberg (2010)"},{"key":"1_CR17","unstructured":"Calvanese, D., Giacomo, G.D., Lembo, D., Lenzerini, M., Rosati, R.: Data complexity of query answering in description logics. In: Proc.\u00a0of KR, pp. 260\u2013270 (2006)"},{"key":"1_CR18","doi-asserted-by":"crossref","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. J. Autom. Reasoning\u00a039(3) (2007)","DOI":"10.1007\/s10817-007-9078-x"},{"issue":"1","key":"1_CR19","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1145\/320434.320440","volume":"1","author":"P.P. Chen","year":"1976","unstructured":"Chen, P.P.: The Entity-Relationship model - Toward a unified view of data. ACM Trans. Database Syst.\u00a01(1), 9\u201336 (1976)","journal-title":"ACM Trans. Database Syst."},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Deutsch, A., Nash, A., Remmel, J.B.: The chase revisited. In: Proc.\u00a0of PODS, pp. 149\u2013158 (2008)","DOI":"10.1145\/1376916.1376938"},{"issue":"3","key":"1_CR21","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. Database Syst.\u00a022(3), 364\u2013418 (1997)","journal-title":"ACM Trans. Database Syst."},{"issue":"1","key":"1_CR22","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."},{"issue":"4","key":"1_CR23","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."},{"issue":"1","key":"1_CR24","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. Comput. Syst. Sci.\u00a028(1), 167\u2013189 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR25","unstructured":"Krisnadhi, A., Lutz, C.: Data complexity in the EL family of DLs. In: Proc.\u00a0of DL (2007)"},{"key":"1_CR26","unstructured":"Kr\u00f6tzsch, M., Rudolph, S.: Extending decidable existential rules by joining acyclicity and guardedness. In: Proc.\u00a0of IJCAI, pp. 963\u2013968 (2011)"},{"key":"1_CR27","unstructured":"Leone, N., Manna, M., Terracina, G., Veltri, P.: Efficiently computable Datalog\u2009\u2203\u2009 programs. In: Proc.\u00a0of KR, pp. 13\u201323 (2012)"},{"key":"1_CR28","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"},{"issue":"4","key":"1_CR29","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 Sem.\u00a05(4), 240\u2013250 (2007)","journal-title":"J. Web Sem."},{"key":"1_CR30","first-page":"133","volume":"10","author":"A. Poggi","year":"2008","unstructured":"Poggi, A., Lembo, D., Calvanese, D., Giacomo, G.D., Lenzerini, M., Rosati, R.: Linking data to ontologies. J. Data Semantics\u00a010, 133\u2013173 (2008)","journal-title":"J. Data Semantics"},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: The complexity of relational query languages (extended abstract). In: Proc.\u00a0of STOCS, pp. 137\u2013146 (1982)","DOI":"10.1145\/800070.802186"},{"key":"1_CR32","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: On the complexity of bounded-variable queries. In: Proc.\u00a0of PODS, pp. 266\u2013276 (1995)","DOI":"10.1145\/212433.212474"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32589-2_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T01:54:32Z","timestamp":1687658072000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32589-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642325885","9783642325892"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32589-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}