{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:41:36Z","timestamp":1725889296944},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319612515"},{"type":"electronic","value":"9783319612522"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","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":[[2017]]},"DOI":"10.1007\/978-3-319-61252-2_10","type":"book-chapter","created":{"date-parts":[[2017,6,13]],"date-time":"2017-06-13T02:55:48Z","timestamp":1497322548000},"page":"135-150","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the Chase for All Provenance Paths with Existential Rules"],"prefix":"10.1007","author":[{"given":"Abdelraouf","family":"Hecham","sequence":"first","affiliation":[]},{"given":"Pierre","family":"Bisquert","sequence":"additional","affiliation":[]},{"given":"Madalina","family":"Croitoru","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,14]]},"reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/3-540-57530-8_7","volume-title":"Deductive and Object-Oriented Databases","author":"T Arora","year":"1993","unstructured":"Arora, T., Ramakrishnan, R., Roth, W.G., Seshadri, P., Srivastava, D.: Explaining program execution in deductive systems. In: Ceri, S., Tanaka, K., Tsur, S. (eds.) DOOD 1993. LNCS, vol. 760, pp. 101\u2013119. Springer, Heidelberg (1993). doi:\n 10.1007\/3-540-57530-8_7"},{"key":"10_CR2","unstructured":"Baget, J.-F., Garreau, F., Mugnier, M.-L., Rocher, S.: Extending acyclicity notions for existential rules. In: ECAI, pp. 39\u201344 (2014)"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Buneman, P., Chapman, A., Cheney, J.: Provenance management in curated databases. In: Proceedings of the 2006 ACM SIGMOD international conference on Management of data, pp. 539\u2013550. ACM (2006)","DOI":"10.1145\/1142473.1142534"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-540-88594-8_8","volume-title":"Semantics in Data and Knowledge Bases","author":"R Caballero","year":"2008","unstructured":"Caballero, R., Garc\u00eda-Ruiz, Y., S\u00e1enz-P\u00e9rez, F.: A theoretical framework for the declarative debugging of datalog programs. In: Schewe, K.-D., Thalheim, B. (eds.) SDKB 2008. LNCS, vol. 4925, pp. 143\u2013159. Springer, Heidelberg (2008). doi:\n 10.1007\/978-3-540-88594-8_8"},{"key":"10_CR5","unstructured":"Cal\u0131, A., Gottlob, G., Kifer, M.: Taming the infinite chase: query answering under expressive relational constraints. In: Proceeding of KR, pp. 70\u201380 (2008)"},{"key":"10_CR6","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. Web Semant. Sci. Serv. Agents World Wide Web 14, 57\u201383 (2012)","journal-title":"Web Semant. Sci. Serv. Agents World Wide Web"},{"issue":"1","key":"10_CR7","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1109\/69.43410","volume":"1","author":"S Ceri","year":"1989","unstructured":"Ceri, S., Gottlob, G., Tanca, L.: What you always wanted to know about datalog (and never dared to ask). IEEE Trans. Knowl. Data Eng. 1(1), 146\u2013166 (1989)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"10_CR8","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. Theoret. Comput. Sci. 336(1), 89\u2013124 (2005)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10_CR9","first-page":"57","volume":"13","author":"WJ Frawley","year":"1992","unstructured":"Frawley, W.J., Piatetsky-Shapiro, G., Matheus, C.J.: Knowledge discovery in databases: an overview. AI Mag. 13(3), 57 (1992)","journal-title":"AI Mag."},{"issue":"2","key":"10_CR10","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0166-218X(93)90045-P","volume":"42","author":"G Gallo","year":"1993","unstructured":"Gallo, G., Longo, G., Pallottino, S., Nguyen, S.: Directed hypergraphs and applications. Discrete Appl. Math. 42(2), 177\u2013201 (1993)","journal-title":"Discrete Appl. Math."},{"key":"10_CR11","unstructured":"Hecham, A., Croitoru, M., Bisquert, P.: Argumentation-based defeasible reasoning for existential rules. In: Proceedings of AAMAS 2017 (2017, to appear)"},{"key":"10_CR12","unstructured":"Ikeda, R., Widom, J.: Data Lineage: A Survey (2009)"},{"key":"10_CR13","first-page":"235","volume":"5","author":"AC Kakas","year":"1998","unstructured":"Kakas, A.C., Kowalski, R.A., Toni, F.: The role of abduction in logic programming. Handb. Logic Artif. Intell. Logic Program. 5, 235\u2013324 (1998)","journal-title":"Handb. Logic Artif. Intell. Logic Program."},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Marnette, B.: Generalized schema-mappings: from termination to tractability. In: Proceedings of the Twenty-Eighth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 13\u201322. ACM (2009)","DOI":"10.1145\/1559795.1559799"},{"key":"10_CR15","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/BFb0083470","volume-title":"Combinatorial Optimization","author":"S Nguyen","year":"1989","unstructured":"Nguyen, S., Pallottino, S.: Hyperpaths and shortest hyperpaths. In: Simeone, B. (ed.) Combinatorial Optimization. LNM, vol. 1403, pp. 258\u2013271. Springer, Heidelberg (1989). doi:\n 10.1007\/BFb0083470"},{"issue":"1","key":"10_CR16","doi-asserted-by":"publisher","first-page":"797","DOI":"10.14778\/1453856.1453943","volume":"1","author":"C R\u00e9","year":"2008","unstructured":"R\u00e9, C., Suciu, D.: Approximate lineage for probabilistic databases. Proc. VLDB Endowment 1(1), 797\u2013808 (2008)","journal-title":"Proc. VLDB Endowment"},{"key":"10_CR17","first-page":"1","volume-title":"Managing and Mining Uncertain Data","author":"J Widom","year":"2008","unstructured":"Widom, J.: Trio: a system for data, uncertainty, and lineage. In: Aggarwa, C.C. (ed.) Managing and Mining Uncertain Data, vol. 35, pp. 1\u201335. Springer, New York (2008)"}],"container-title":["Lecture Notes in Computer Science","Rules and Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-61252-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T06:28:20Z","timestamp":1558333700000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-61252-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319612515","9783319612522"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-61252-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"14 June 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RuleML+RR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Joint Conference on Rules and Reasoning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 July 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 July 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rulemlrr2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2017.ruleml-rr.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}