{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,14]],"date-time":"2024-05-14T00:07:34Z","timestamp":1715645254248},"reference-count":26,"publisher":"Cambridge University Press (CUP)","issue":"4-5","license":[{"start":{"date-parts":[[2013,9,25]],"date-time":"2013-09-25T00:00:00Z","timestamp":1380067200000},"content-version":"unspecified","delay-in-days":86,"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":[[2013,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Existential rules are Datalog rules extended with existential quantifiers in rule-heads. Three fundamental restriction paradigms that have been studied for ensuring decidability of query answering under existential rules are weak-acyclicity, guardedness and stickiness. Towards the identification of even more expressive decidable languages, several attempts have been conducted to consolidate weak-acyclicity with the other two paradigms. However, it is not clear how guardedness and stickiness can be merged; this is the subject of this paper. A powerful and flexible condition, called tameness, is proposed, which allows us to consolidate in an elegant and uniform way guardedness with stickiness.<\/jats:p>","DOI":"10.1017\/s1471068413000550","type":"journal-article","created":{"date-parts":[[2013,9,25]],"date-time":"2013-09-25T16:24:58Z","timestamp":1380126298000},"page":"877-892","source":"Crossref","is-referenced-by-count":8,"title":["Combining decidability paradigms for existential rules"],"prefix":"10.1017","volume":"13","author":[{"given":"GEORG","family":"GOTTLOB","sequence":"first","affiliation":[]},{"given":"MARCO","family":"MANNA","sequence":"additional","affiliation":[]},{"given":"ANDREAS","family":"PIERIS","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2013,9,25]]},"reference":[{"key":"S1471068413000550_ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2007.09.004"},{"key":"S1471068413000550_ref24","doi-asserted-by":"publisher","DOI":"10.1145\/320107.320115"},{"key":"S1471068413000550_ref20","unstructured":"Kr\u00f6tzsch M. and Rudolph S. 2011. Extending decidable existential rules by joining acyclicity and guardedness. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence, 963\u2013968."},{"key":"S1471068413000550_ref16","doi-asserted-by":"publisher","DOI":"10.1145\/962446.962450"},{"key":"S1471068413000550_ref15","doi-asserted-by":"crossref","unstructured":"Gogacz T. and Marcinkowski J. 2013. Converging to the chase - a tool for finite controllability. In Proceedings of the 28th Annual IEEE Symposium on Logic in Computer Science, To appear.","DOI":"10.1109\/LICS.2013.61"},{"key":"S1471068413000550_ref14","unstructured":"Gebser M. , Kaufmann B. , Neumann A. and Schaub T. 2007. Conflict-driven answer set solving. In Proceedings of the 20th International Joint Conference on Artificial Intelligence, 386\u2013392."},{"key":"S1471068413000550_ref12","unstructured":"Deutsch A. , Nash A. and Remmel J. B. 2008. The chase revisisted. In Proceedings of the 27th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 149\u2013158."},{"key":"S1471068413000550_ref11","doi-asserted-by":"publisher","DOI":"10.1145\/800105.803397"},{"key":"S1471068413000550_ref10","doi-asserted-by":"crossref","unstructured":"Ceri S. , Gottlob G. and Tanca L. 1990. Logic Programming and Databases. Springer.","DOI":"10.1007\/978-3-642-83952-8"},{"key":"S1471068413000550_ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2012.03.001"},{"key":"S1471068413000550_ref6","unstructured":"Bourhis P. , Morak M. and Pieris A. 2013. The impact of disjunction on query answering under guarded-based existential rules. In Proceedings of the 23rd International Joint Conference on Artificial Intelligence, To appear."},{"key":"S1471068413000550_ref4","unstructured":"Barany V. , Gottlob G. and Otto M. 2010. Querying the guarded fragment. In Proceedings of the 25th IEEE Symposium on Logic in Computer Science, 1\u201310."},{"key":"S1471068413000550_ref7","unstructured":"Cal\u00ec A. , Gottlob G. and Kifer M. 2008. Taming the infinite chase: Query answering under expressive relational constraints. In Proceedings of the 11th International Conference on Principles of Knowledge Representation and Reasoning, 70\u201380."},{"key":"S1471068413000550_ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1149114.1149117"},{"key":"S1471068413000550_ref2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1004275029985"},{"key":"S1471068413000550_ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90081-3"},{"key":"S1471068413000550_ref17","unstructured":"Gottlob G. , Manna M. , Morak M. and Pieris A. 2012. On the complexity of ontological reasoning under disjunctive existential rules. In Proceedings of the 37th International Symposium Mathematical Foundations of Computer Science, 1\u201318."},{"key":"S1471068413000550_ref1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068412000257"},{"key":"S1471068413000550_ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2012.08.002"},{"key":"S1471068413000550_ref25","doi-asserted-by":"crossref","unstructured":"Marczak W. R. , Alvaro P. , Conway N. , Hellerstein J. M. and Maier D. 2012. Confluence analysis for distributed programs: A model-theoretic approach. In Proceedings of Datalog 2.0. 135\u2013147.","DOI":"10.1007\/978-3-642-32925-8_14"},{"key":"S1471068413000550_ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2011.03.002"},{"key":"S1471068413000550_ref18","unstructured":"Hajiyev E. , Verbaere M. and de Moor O. 2006. codeQuest: Scalable source code queries with Datalog. In Proceedings of the 20th European Conference on Object-Oriented Programming, 2\u201327."},{"key":"S1471068413000550_ref5","unstructured":"Beeri C. and Vardi M. Y. 1981. The implication problem for data dependencies. In Proceedings of the 8th International Colloquium on Automata, Languages and Programming, 73\u201385."},{"key":"S1471068413000550_ref23","unstructured":"Lierler Y. and Maratea M. 2004. Cmodels-2: SAT-based answer set solver enhanced to non-tight programs. In Proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning, 346\u2013350."},{"key":"S1471068413000550_ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.10.033"},{"key":"S1471068413000550_ref21","unstructured":"Leone N. , Manna M. , Terracina G. and Veltri P. 2012. Efficiently computable Datalog\u2203 programs. In Proceedings of the 13th International Conference on Principles of Knowledge Representation and Reasoning."}],"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\/S1471068413000550","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T09:29:23Z","timestamp":1715592563000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068413000550\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":26,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["S1471068413000550"],"URL":"https:\/\/doi.org\/10.1017\/s1471068413000550","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7]]}}}