{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:30:41Z","timestamp":1725798641742},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662445211"},{"type":"electronic","value":"9783662445228"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44522-8_9","type":"book-chapter","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T06:12:23Z","timestamp":1407823943000},"page":"99-110","source":"Crossref","is-referenced-by-count":2,"title":["Towards Efficient Reasoning Under Guarded-Based Disjunctive Existential Rules"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Bourhis","sequence":"first","affiliation":[]},{"given":"Michael","family":"Morak","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Pieris","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley (1995)"},{"issue":"4-5","key":"9_CR2","first-page":"701","volume":"12","author":"M. Alviano","year":"2012","unstructured":"Alviano, M., Faber, W., Leone, N., Manna, M.: Disjunctive Datalog with existential quantifiers: Semantics, decidability, and complexity issues. TPLP\u00a012(4-5), 701\u2013718 (2012)","journal-title":"TPLP"},{"key":"9_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., van Benthem, J., N\u00e9meti, I.: Modal languages and bounded fragments of predicate logic. J. Philosophical Logic\u00a027, 217\u2013274 (1998)","journal-title":"J. Philosophical Logic"},{"key":"9_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.2820","volume":"36","author":"A. Artale","year":"2009","unstructured":"Artale, A., Calvanese, D., Kontchakov, R., Zakharyaschev, M.: The DL-Lite family and relations. J. Artif. Intell. Res.\u00a036, 1\u201369 (2009)","journal-title":"J. Artif. Intell. Res."},{"key":"9_CR5","unstructured":"Baeza, P.B.: Querying graph databases. In: PODS, pp. 175\u2013188 (2013)"},{"issue":"9-10","key":"9_CR6","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":"9_CR7","unstructured":"Baget, J.F., Mugnier, M.L., Rudolph, S., Thomazo, M.: Walking the complexity lines for generalized guarded existential rules. In: IJCAI, pp. 712\u2013717 (2011)"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"B\u00e1r\u00e1ny, V., Gottlob, G., Otto, M.: Querying the guarded fragment. In: LICS, pp. 1\u201310 (2010)","DOI":"10.1109\/LICS.2010.26"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-642-22012-8_28","volume-title":"Automata, Languages and Programming","author":"V. B\u00e1r\u00e1ny","year":"2011","unstructured":"B\u00e1r\u00e1ny, V., ten Cate, B., Segoufin, L.: Guarded negation. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol.\u00a06756, pp. 356\u2013367. Springer, Heidelberg (2011)"},{"key":"9_CR10","series-title":"LNCS","first-page":"73","volume-title":"ICALP","author":"C. Beeri","year":"1981","unstructured":"Beeri, C., Vardi, M.Y.: The implication problem for data dependencies. In: Even, S., Kariv, O. (eds.) ICALP. LNCS, vol.\u00a0115, pp. 73\u201385. Springer, Heidelberg (1981)"},{"key":"9_CR11","unstructured":"Bourhis, P., Morak, M., Pieris, A.: The impact of disjunction on query answering under guarded-based existential rules. In: IJCAI (2013)"},{"key":"9_CR12","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1613\/jair.3873","volume":"48","author":"A. Cal\u00ec","year":"2013","unstructured":"Cal\u00ec, A., Gottlob, G., Kifer, M.: Taming the infinite chase: Query answering under expressive relational constraints. J. Artif. Intell. Res.\u00a048, 115\u2013174 (2013)","journal-title":"J. Artif. Intell. Res."},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.websem.2012.03.001","volume":"14","author":"A. Cal\u00ec","year":"2012","unstructured":"Cal\u00ec, A., Gottlob, G., Lukasiewicz, T.: A general Datalog-based framework for tractable query answering over ontologies. J. Web Sem.\u00a014, 57\u201383 (2012)","journal-title":"J. Web Sem."},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.artint.2012.08.002","volume":"193","author":"A. Cal\u00ec","year":"2012","unstructured":"Cal\u00ec, A., Gottlob, G., Pieris, A.: Towards more expressive ontology languages: The query answering problem. Artif. Intell.\u00a0193, 87\u2013128 (2012)","journal-title":"Artif. Intell."},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.artint.2012.10.003","volume":"195","author":"D. Calvanese","year":"2013","unstructured":"Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Data complexity of query answering in description logics. Artif. Intell.\u00a0195, 335\u2013360 (2013)","journal-title":"Artif. Intell."},{"issue":"2","key":"9_CR16","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0304-3975(99)00220-0","volume":"239","author":"C. Chekuri","year":"2000","unstructured":"Chekuri, C., Rajaraman, A.: Conjunctive query containment revisited. Theor. Comput. Sci.\u00a0239(2), 211\u2013229 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/3-540-36285-1_15","volume-title":"Database Theory - ICDT 2003","author":"A. Deutsch","year":"2002","unstructured":"Deutsch, A., Tannen, V.: Reformulation of XML queries and constraints. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol.\u00a02572, pp. 225\u2013241. Springer, Heidelberg (2002)"},{"issue":"1","key":"9_CR18","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":"3","key":"9_CR19","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1145\/382780.382783","volume":"48","author":"G. Gottlob","year":"2001","unstructured":"Gottlob, G., Leone, N., Scarcello, F.: The complexity of acyclic conjunctive queries. J. ACM\u00a048(3), 431\u2013498 (2001)","journal-title":"J. ACM"},{"issue":"3","key":"9_CR20","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1006\/jcss.2001.1809","volume":"64","author":"G. Gottlob","year":"2002","unstructured":"Gottlob, G., Leone, N., Scarcello, F.: Hypertree decompositions and tractable queries. J. Comput. Syst. Sci.\u00a064(3), 579\u2013627 (2002)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"9_CR21","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1016\/S0022-0000(03)00030-8","volume":"66","author":"G. Gottlob","year":"2003","unstructured":"Gottlob, G., Leone, N., Scarcello, F.: Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width. J. Comput. Syst. Sci.\u00a066(4), 775\u2013808 (2003)","journal-title":"J. Comput. Syst. Sci."},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-32589-2_1","volume-title":"Mathematical Foundations of Computer Science 2012","author":"G. Gottlob","year":"2012","unstructured":"Gottlob, G., Manna, M., Morak, M., Pieris, A.: On the complexity of ontological reasoning under disjunctive existential rules. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol.\u00a07464, pp. 1\u201318. Springer, Heidelberg (2012)"},{"issue":"4-5","key":"9_CR23","first-page":"877","volume":"13","author":"G. Gottlob","year":"2013","unstructured":"Gottlob, G., Manna, M., Pieris, A.: Combining decidability paradigms for existential rules. TPLP\u00a013(4-5), 877\u2013892 (2013)","journal-title":"TPLP"},{"issue":"4","key":"9_CR24","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":"9_CR25","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1613\/jair.3949","volume":"47","author":"B.C. Grau","year":"2013","unstructured":"Grau, B.C., Horrocks, I., Kr\u00f6tzsch, M., Kupke, C., Magka, D., Motik, B., Wang, Z.: Acyclicity notions for existential rules and their application to query answering in ontologies. J. Artif. Intell. Res.\u00a047, 741\u2013808 (2013)","journal-title":"J. Artif. Intell. Res."},{"key":"9_CR26","unstructured":"Kr\u00f6tzsch, M., Rudolph, S.: Extending decidable existential rules by joining acyclicity and guardedness. In: IJCAI, pp. 963\u2013968 (2011)"},{"key":"9_CR27","unstructured":"Leone, N., Manna, M., Terracina, G., Veltri, P.: Efficiently computable Datalog\u2009\u2203\u2009 programs. In: KR (2012)"},{"issue":"4","key":"9_CR28","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."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2014"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44522-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T23:10:16Z","timestamp":1558307416000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44522-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662445211","9783662445228"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44522-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}