{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T17:05:29Z","timestamp":1725987929875},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319999050"},{"type":"electronic","value":"9783319999067"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-99906-7_7","type":"book-chapter","created":{"date-parts":[[2018,8,23]],"date-time":"2018-08-23T10:45:38Z","timestamp":1535021138000},"page":"98-114","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Restricted Chase Termination: A Hierarchical Approach and Experimentation"],"prefix":"10.1007","author":[{"given":"Arash","family":"Karimi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jia-Huai","family":"You","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,24]]},"reference":[{"key":"7_CR1","unstructured":"Baget, J.-F.: Improving the forward chaining algorithm for conceptual graphs rules. In: Proceedings KR 2004, pp. 407\u2013414 (2004)"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/978-3-319-21542-6_21","volume-title":"Rule Technologies: Foundations, Tools, and Applications","author":"J-F Baget","year":"2015","unstructured":"Baget, J.-F., Lecl\u00e8re, M., Mugnier, M.-L., Rocher, S., Sipieter, C.: Graal: a toolkit for query answering with existential rules. In: Bassiliades, N., Gottlob, G., Sadri, F., Paschke, A., Roman, D. (eds.) RuleML 2015. LNCS, vol. 9202, pp. 328\u2013344. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21542-6_21"},{"key":"7_CR3","unstructured":"Baget, J.-F., Michel, M., Mugnier, M.-L., Salvat, E.: Extending decidable cases for rules with existential variables. In: Proceedings IJCAI 2009, pp. 677\u2013682 (2009)"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1613\/jair.918","volume":"16","author":"J-F Baget","year":"2002","unstructured":"Baget, J.-F., Mugnier, M.-L.: Extensions of simple conceptual graphs: the complexity of rules and constraints. J. Artif. Intell. Res. 16, 425\u2013465 (2002)","journal-title":"J. Artif. Intell. Res."},{"key":"7_CR5","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. 115, pp. 73\u201385. Springer, Heidelberg (1981). https:\/\/doi.org\/10.1007\/3-540-10843-2_7"},{"issue":"4","key":"7_CR6","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. JACM 31(4), 718\u2013741 (1984)","journal-title":"JACM"},{"key":"7_CR7","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: Proceedings LICS 2010, pp. 228\u2013242 (2010)","DOI":"10.1109\/LICS.2010.27"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Carral, D., Dragoste, I., Kr\u00f6tzsch, M.: Restricted chase (non) termination for existential rules with disjunctions. In: Proceedings IJCAI 2017, pp. 922\u2013928 (2017)","DOI":"10.24963\/ijcai.2017\/128"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/978-3-319-08587-6_36","volume-title":"Automated Reasoning","author":"D Carral","year":"2014","unstructured":"Carral, D., Feier, C., Cuenca Grau, B., Hitzler, P., Horrocks, I.: $$\\cal{EL}$$-ifying ontologies. In: Demri, S., Kapur, D., Weidenbach, C. (eds.) IJCAR 2014. LNCS (LNAI), vol. 8562, pp. 464\u2013479. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08587-6_36"},{"key":"7_CR10","unstructured":"Grau, B.C., et al.: Acyclicity notions for existential rules and their application to query answering in ontologies. J. Artif. Intell. Res. 47, 741\u2013808 (2013)"},{"issue":"1","key":"7_CR11","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. 336(1), 89\u2013124 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR12","unstructured":"Grahne, G., Onet, A.: The data-exchange chase under the microscope. CoRR, abs\/1407.2279 (2014)"},{"key":"7_CR13","unstructured":"Karimi, A., Zhang, H., You, J.-H.: A hierarchical approach to restricted chase termination for existential rules. Technical report, University of Alberta, Edmonton, AB, Canada (2018)"},{"key":"7_CR14","unstructured":"Kr\u00f6tzsch, M., Rudolph, S.: Extending decidable existential rules by joining acyclicity and guardedness. In: Proceedings AAAI 2011 (2011)"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Marnette, B.: Generalized schema-mappings: from termination to tractability. In: Proceedings PODS 2009, pp. 13\u201322. ACM (2009)","DOI":"10.1145\/1559795.1559799"},{"key":"7_CR16","unstructured":"Matentzoglu, N., Parsia, B.: The Manchester OWL Corpus (MOWLCorp), original serialisation, July 2014"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Zhang, H., Zhang, Y., You, J.-H.: Existential rule languages with finite chase: complexity and expressiveness. In Proceedings AAAI 2015, pp. 1678\u20131684. AAAI Press (2015)","DOI":"10.1609\/aaai.v29i1.9404"}],"container-title":["Lecture Notes in Computer Science","Rules and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99906-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,30]],"date-time":"2022-08-30T02:33:17Z","timestamp":1661826797000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-99906-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319999050","9783319999067"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99906-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}