{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T19:49:23Z","timestamp":1725738563936},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642392115"},{"type":"electronic","value":"9783642392122"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39212-2_27","type":"book-chapter","created":{"date-parts":[[2013,7,2]],"date-time":"2013-07-02T13:09:19Z","timestamp":1372770559000},"page":"287-298","source":"Crossref","is-referenced-by-count":7,"title":["Querying the Guarded Fragment with Transitivity"],"prefix":"10.1007","author":[{"given":"Georg","family":"Gottlob","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Pieris","sequence":"additional","affiliation":[]},{"given":"Lidia","family":"Tendera","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","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"},{"issue":"4","key":"27_CR2","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":"27_CR3","unstructured":"Ganzinger, H., Meyer, C., Veanes, M.: The two-variable guarded fragment with transitive relations. In: Proc.\u00a0of LICS, pp. 24\u201334 (1999)"},{"key":"27_CR4","unstructured":"Szwast, W., Tendera, L.: On the decision problem for the guarded fragment with transitivity. In: Proc.\u00a0of LICS, pp. 147\u2013156 (2001)"},{"issue":"1-3","key":"27_CR5","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/j.apal.2004.01.003","volume":"128","author":"W. Szwast","year":"2004","unstructured":"Szwast, W., Tendera, L.: The guarded fragment with transitive guards. Ann. Pure Appl. Logic\u00a0128(1-3), 227\u2013276 (2004)","journal-title":"Ann. Pure Appl. Logic"},{"key":"27_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/3-540-36576-1_19","volume-title":"Foundations of Software Science and Computational Structures","author":"E. Kiero\u0144ski","year":"2003","unstructured":"Kiero\u0144ski, E.: The two-variable guarded fragment with transitive guards is 2EXPTIME-hard. In: Gordon, A.D. (ed.) FOSSACS 2003. LNCS, vol.\u00a02620, pp. 299\u2013312. Springer, Heidelberg (2003)"},{"key":"27_CR7","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)"},{"issue":"3","key":"27_CR8","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s10817-007-9078-x","volume":"39","author":"D. Calvanese","year":"2007","unstructured":"Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Tractable reasoning and efficient query answering in description logics: The DL-Lite family. J. Autom. Reasoning\u00a039(3), 385\u2013429 (2007)","journal-title":"J. Autom. Reasoning"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"B\u00e1r\u00e1ny, V., Gottlob, G., Otto, M.: Querying the guarded fragment. In: Proc. of LICS, pp. 1\u201310 (2010)","DOI":"10.1109\/LICS.2010.26"},{"key":"27_CR10","unstructured":"Baget, J.F., Mugnier, M.L., Rudolph, S., Thomazo, M.: Walking the complexity lines for generalized guarded existential rules. In: Proc.\u00a0of IJCAI, pp. 712\u2013717 (2011)"},{"key":"27_CR11","unstructured":"Kr\u00f6tzsch, M., Rudolph, S.: Extending decidable existential rules by joining acyclicity and guardedness. In: Proc.\u00a0of IJCAI, pp. 963\u2013968 (2011)"},{"issue":"8","key":"27_CR12","doi-asserted-by":"publisher","first-page":"867","DOI":"10.1016\/j.ic.2009.02.004","volume":"207","author":"I. Pratt-Hartmann","year":"2009","unstructured":"Pratt-Hartmann, I.: Data-complexity of the two-variable fragment with counting quantifiers. Inf. Comput.\u00a0207(8), 867\u2013888 (2009)","journal-title":"Inf. Comput."},{"key":"27_CR13","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":"27_CR14","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)"},{"key":"27_CR15","unstructured":"Kazakov, Y.: Saturation-based decision procedures for extensions of the guarded fragment. PhD thesis, Universit\u00e4t des Saarlandes (2005)"},{"key":"27_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/11538363_22","volume-title":"Computer Science Logic","author":"E. Kiero\u0144ski","year":"2005","unstructured":"Kiero\u0144ski, E.: Results on the guarded fragment with equivalence or transitive relations. In: Ong, L. (ed.) CSL 2005. LNCS, vol.\u00a03634, pp. 309\u2013324. Springer, Heidelberg (2005)"},{"issue":"4","key":"27_CR17","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1145\/1634.1636","volume":"31","author":"C. Beeri","year":"1984","unstructured":"Beeri, C., Vardi, M.Y.: A proof procedure for data dependencies. J. ACM\u00a031(4), 718\u2013741 (1984)","journal-title":"J. ACM"},{"issue":"3","key":"27_CR18","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s10849-005-5791-1","volume":"14","author":"I. Pratt-Hartmann","year":"2005","unstructured":"Pratt-Hartmann, I.: Complexity of the two-variable fragment with counting quantifiers. Journal of Logic, Language and Information\u00a014(3), 369\u2013395 (2005)","journal-title":"Journal of Logic, Language and Information"},{"issue":"4","key":"27_CR19","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":"27_CR20","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., Giacomo, G.D., Lembo, D., Lenzerini, M., Rosati, R.: Data complexity of query answering in description logics. Artif. Intell.\u00a0195, 335\u2013360 (2013)","journal-title":"Artif. Intell."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39212-2_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T09:28:56Z","timestamp":1557912536000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39212-2_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642392115","9783642392122"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39212-2_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}