{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T13:09:48Z","timestamp":1790687388235,"version":"4.1.0"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030600662","type":"print"},{"value":"9783030600679","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-60067-9_7","type":"book-chapter","created":{"date-parts":[[2020,10,17]],"date-time":"2020-10-17T10:02:50Z","timestamp":1602928970000},"page":"186-222","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Declarative Data Analysis Using Limit Datalog Programs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8886-6129","authenticated-orcid":false,"given":"Egor V.","family":"Kostylev","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,10,18]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","unstructured":"Alvaro, P., Condie, T., Conway, N., Elmeleegy, K., Hellerstein, J.M., Sears, R.: BOOM analytics: exploring data-centric, declarative programming for the cloud. In: Morin, C., Muller, G. (eds.) EuroSys. pp. 223\u2013236. ACM (2010). \nhttps:\/\/doi.org\/10.1145\/1755913.1755937","DOI":"10.1145\/1755913.1755937"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Aref, M., et al.: Design and implementation of the LogicBlox system. In: SIGMOD, pp. 1371\u20131382 (2015)","DOI":"10.1145\/2723372.2742796"},{"issue":"3&4","key":"7_CR3","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0743-1066(91)90036-O","volume":"10","author":"C Beeri","year":"1991","unstructured":"Beeri, C., Naqvi, S.A., Shmueli, O., Tsur, S.: Set constructors in a logic database language. J. Log. Program. 10(3&4), 181\u2013232 (1991). \nhttps:\/\/doi.org\/10.1016\/0743-1066(91)90036-O","journal-title":"J. Log. Program."},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0304-3975(80)90037-7","volume":"11","author":"L Berman","year":"1980","unstructured":"Berman, L.: The complexitiy of logical theories. Theor. Comput. Sci. 11, 71\u201377 (1980). \nhttps:\/\/doi.org\/10.1016\/0304-3975(80)90037-7","journal-title":"Theor. Comput. Sci."},{"key":"7_CR5","doi-asserted-by":"publisher","unstructured":"Chin, B., et al.: Yedalog: exploring knowledge at scale. In: Ball, T., Bod\u00edk, R., Krishnamurthi, S., Lerner, B.S., Morrisett, G. (eds.) SNAPL. LIPIcs, vol. 32, pp. 63\u201378. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2015). \nhttps:\/\/doi.org\/10.4230\/LIPIcs.SNAPL.2015.63","DOI":"10.4230\/LIPIcs.SNAPL.2015.63"},{"key":"7_CR6","doi-asserted-by":"publisher","unstructured":"Chistikov, D., Haase, C.: The taming of the semi-linear set. In: Chatzigiannakis, I., Mitzenmacher, M., Rabani, Y., Sangiorgi, D. (eds.) ICALP. LIPIcs, vol. 55, pp. 128:1\u2013128:13. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016). \nhttps:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2016.128","DOI":"10.4230\/LIPIcs.ICALP.2016.128"},{"issue":"1","key":"7_CR7","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(93)90221-E","volume":"116","author":"MP Consens","year":"1993","unstructured":"Consens, M.P., Mendelzon, A.O.: Low-complexity aggregation in GraphLog and Datalog. Theor. Comput. Sci. 116(1), 95\u2013116 (1993). \nhttps:\/\/doi.org\/10.1016\/0304-3975(93)90221-E","journal-title":"Theor. Comput. Sci."},{"issue":"2\u20134","key":"7_CR8","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BF01543475","volume":"5","author":"J Cox","year":"1992","unstructured":"Cox, J., McAloon, K., Tretkoff, C.: Computational complexity and constraint logic programming languages. Ann. Math. Artif. Intell. 5(2\u20134), 163\u2013189 (1992). \nhttps:\/\/doi.org\/10.1007\/BF01543475","journal-title":"Ann. Math. Artif. Intell."},{"issue":"4","key":"7_CR9","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1145\/3385658.3385660","volume":"48","author":"B Cuenca Grau","year":"2019","unstructured":"Cuenca Grau, B., Horrocks, I., Kaminski, M., Kostylev, E.V., Motik, B.: Limit Datalog: a declarative query language for data analysis. ACM SIGMOD Rec. (SIGMOD Rec.) 48(4), 6\u201317 (2019)","journal-title":"ACM SIGMOD Rec. (SIGMOD Rec.)"},{"issue":"3","key":"7_CR10","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/502807.502810","volume":"33","author":"E Dantsin","year":"2001","unstructured":"Dantsin, E., Eiter, T., Gottlob, G., Voronkov, A.: Complexity and expressive power of logic programming. ACM Comput. Surv. 33(3), 374\u2013425 (2001). \nhttps:\/\/doi.org\/10.1145\/502807.502810","journal-title":"ACM Comput. Surv."},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-642-24206-9_11","volume-title":"Datalog Reloaded","author":"J Eisner","year":"2011","unstructured":"Eisner, J., Filardo, N.W.: Dyna: extending Datalog for modern AI. In: de Moor, O., Gottlob, G., Furche, T., Sellers, A. (eds.) Datalog 2.0 2010. LNCS, vol. 6702, pp. 181\u2013220. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-24206-9_11"},{"issue":"1","key":"7_CR12","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/j.artint.2010.04.002","volume":"175","author":"W Faber","year":"2011","unstructured":"Faber, W., Pfeifer, G., Leone, N.: Semantics and complexity of recursive aggregates in answer set programming. Artif. Intell. 175(1), 278\u2013298 (2011). \nhttps:\/\/doi.org\/10.1016\/j.artint.2010.04.002","journal-title":"Artif. Intell."},{"issue":"2","key":"7_CR13","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1006\/jcss.1995.1064","volume":"51","author":"S Ganguly","year":"1995","unstructured":"Ganguly, S., Greco, S., Zaniolo, C.: Extrema predicates in deductive databases. J. Comput. Syst. Sci. 51(2), 244\u2013259 (1995). \nhttps:\/\/doi.org\/10.1006\/jcss.1995.1064","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0304-3975(88)90136-3","volume":"56","author":"E Gr\u00e4del","year":"1988","unstructured":"Gr\u00e4del, E.: Subclasses of Presburger arithmetic and the polynomial-time hierarchy. Theor. Comput. Sci. 56, 289\u2013301 (1988). \nhttps:\/\/doi.org\/10.1016\/0304-3975(88)90136-3","journal-title":"Theor. Comput. Sci."},{"key":"7_CR15","doi-asserted-by":"publisher","unstructured":"Haase, C.: Subclasses of Presburger arithmetic and the weak EXP hierarchy. In: Henzinger, T.A., Miller, D. (eds.) CSL-LICS, pp. 47:1\u201347:10. ACM (2014). \nhttps:\/\/doi.org\/10.1145\/2603088.2603092","DOI":"10.1145\/2603088.2603092"},{"key":"7_CR16","doi-asserted-by":"publisher","unstructured":"Hougardy, S.: The Floyd-Warshall algorithm on graphs with negative cycles. Inf. Process. Lett. 110(8\u20139), 279\u2013281 (2010). \nhttps:\/\/doi.org\/10.1016\/j.ipl.2010.02.001","DOI":"10.1016\/j.ipl.2010.02.001"},{"key":"7_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0539-5","volume-title":"Descriptive Complexity","author":"N Immerman","year":"1999","unstructured":"Immerman, N.: Descriptive Complexity. Springer, New York (1999). \nhttps:\/\/doi.org\/10.1007\/978-1-4612-0539-5"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Kaminski, M., Cuenca Grau, B., Kostylev, E.V., Horrocks, I.: Complexity and expressive power of disjunction and negation in limit Datalog. In: AAAI. AAAI Press (2020)","DOI":"10.1609\/aaai.v34i03.5676"},{"key":"7_CR19","doi-asserted-by":"publisher","unstructured":"Kaminski, M., Cuenca Grau, B., Kostylev, E.V., Motik, B., Horrocks, I.: Foundations of declarative data analysis using limit Datalog programs. In: Sierra, C. (ed.) IJCAI, pp. 1123\u20131130. ijcai.org (2017). \nhttps:\/\/doi.org\/10.24963\/ijcai.2017\/156","DOI":"10.24963\/ijcai.2017\/156"},{"key":"7_CR20","doi-asserted-by":"publisher","unstructured":"Kaminski, M., Cuenca Grau, B., Kostylev, E.V., Motik, B., Horrocks, I.: Stratified negation in limit Datalog programs. In: Lang, J. (ed.) IJCAI, pp. 1875\u20131881. ijcai.org (2018). \nhttps:\/\/doi.org\/10.24963\/ijcai.2018\/259","DOI":"10.24963\/ijcai.2018\/259"},{"issue":"3","key":"7_CR21","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1287\/moor.12.3.415","volume":"12","author":"R Kannan","year":"1987","unstructured":"Kannan, R.: Minkowski\u2019s convex body theorem and integer programming. Math. Oper. Res. 12(3), 415\u2013440 (1987). \nhttps:\/\/doi.org\/10.1287\/moor.12.3.415","journal-title":"Math. Oper. Res."},{"key":"7_CR22","unstructured":"Kemp, D.B., Stuckey, P.J.: Semantics of logic programs with aggregates. In: Saraswat, V.A., Ueda, K. (eds.) ISLP, pp. 387\u2013401. MIT Press (1991)"},{"issue":"11","key":"7_CR23","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1145\/1592761.1592785","volume":"52","author":"BT Loo","year":"2009","unstructured":"Loo, B.T., et al.: Declarative networking. Commun. ACM 52(11), 87\u201395 (2009). \nhttps:\/\/doi.org\/10.1145\/1592761.1592785","journal-title":"Commun. ACM"},{"key":"7_CR24","doi-asserted-by":"publisher","unstructured":"Markl, V.: Breaking the chains: on declarative data analysis and data independence in the big data era. PVLDB 7(13), 1730\u20131733 (2014). \nhttps:\/\/doi.org\/10.14778\/2733004.2733075","DOI":"10.14778\/2733004.2733075"},{"issue":"4","key":"7_CR25","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s00778-012-0299-1","volume":"22","author":"M Mazuran","year":"2013","unstructured":"Mazuran, M., Serra, E., Zaniolo, C.: Extending the power of Datalog recursion. VLDB J. 22(4), 471\u2013493 (2013). \nhttps:\/\/doi.org\/10.1007\/s00778-012-0299-1","journal-title":"VLDB J."},{"issue":"1","key":"7_CR26","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/BF01585518","volume":"7","author":"RR Meyer","year":"1974","unstructured":"Meyer, R.R.: On the existence of optimal solutions to integer and mixed-integer programming problems. Math. Program. 7(1), 223\u2013235 (1974). \nhttps:\/\/doi.org\/10.1007\/BF01585518","journal-title":"Math. Program."},{"key":"7_CR27","unstructured":"Mumick, I.S., Pirahesh, H., Ramakrishnan, R.: The magic of duplicates and aggregates. In: McLeod, D., Sacks-Davis, R., Schek, H. (eds.) VLDB, pp. 264\u2013277. Morgan Kaufmann (1990)"},{"issue":"4","key":"7_CR28","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1145\/322276.322287","volume":"28","author":"CH Papadimitriou","year":"1981","unstructured":"Papadimitriou, C.H.: On the complexity of integer programming. J. ACM 28(4), 765\u2013768 (1981). \nhttps:\/\/doi.org\/10.1145\/322276.322287","journal-title":"J. ACM"},{"issue":"1","key":"7_CR29","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1006\/jcss.1997.1453","volume":"54","author":"KA Ross","year":"1997","unstructured":"Ross, K.A., Sagiv, Y.: Monotonic aggregation in deductive databases. J. Comput. Syst. Sci. 54(1), 79\u201397 (1997). \nhttps:\/\/doi.org\/10.1006\/jcss.1997.1453","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"7_CR30","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1006\/jcss.1995.1053","volume":"51","author":"JS Schlipf","year":"1995","unstructured":"Schlipf, J.S.: The expressive powers of the logic programming semantics. J. Comput. Syst. Sci. 51(1), 64\u201386 (1995). \nhttps:\/\/doi.org\/10.1006\/jcss.1995.1053","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR31","doi-asserted-by":"publisher","unstructured":"Sch\u00f6ning, U.: Complexity of Presburger arithmetic with fixed quantifier dimension. Theor. Comput. Sci. 30(4), 423\u2013428 (1997). \nhttps:\/\/doi.org\/10.1007\/BF02679468","DOI":"10.1007\/BF02679468"},{"key":"7_CR32","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1999","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Hoboken (1999)"},{"issue":"7","key":"7_CR33","doi-asserted-by":"publisher","first-page":"1824","DOI":"10.1109\/TKDE.2015.2405562","volume":"27","author":"J Seo","year":"2015","unstructured":"Seo, J., Guo, S., Lam, M.S.: SociaLite: an efficient graph query language based on Datalog. IEEE Trans. Knowl. Data Eng. 27(7), 1824\u20131837 (2015). \nhttps:\/\/doi.org\/10.1109\/TKDE.2015.2405562","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"7_CR34","doi-asserted-by":"publisher","unstructured":"Shkapsky, A., Yang, M., Interlandi, M., Chiu, H., Condie, T., Zaniolo, C.: Big data analytics with Datalog queries on Spark. In: \u00d6zcan, F., Koutrika, G., Madden, S. (eds.) SIGMOD, pp. 1135\u20131149. ACM (2016). \nhttps:\/\/doi.org\/10.1145\/2882903.2915229","DOI":"10.1145\/2882903.2915229"},{"key":"7_CR35","unstructured":"Sudarshan, S., Ramakrishnan, R.: Aggregation and relevance in deductive databases. In: Lohman, G.M., Sernadas, A., Camps, R. (eds.) VLDB, pp. 501\u2013511. Morgan Kaufmann (1991)"},{"key":"7_CR36","doi-asserted-by":"publisher","unstructured":"Van Gelder, A.: The well-founded semantics of aggregation. In: Vardi, M.Y., Kanellakis, P.C. (eds.) PODS, pp. 127\u2013138. ACM Press (1992). \nhttps:\/\/doi.org\/10.1145\/137097.137854","DOI":"10.1145\/137097.137854"},{"key":"7_CR37","doi-asserted-by":"publisher","unstructured":"Wang, J., Balazinska, M., Halperin, D.: Asynchronous and fault-tolerant recursive Datalog evaluation in shared-nothing engines. PVLDB 8(12), 1542\u20131553 (2015). \nhttps:\/\/doi.org\/10.14778\/2824032.2824052","DOI":"10.14778\/2824032.2824052"},{"issue":"2","key":"7_CR38","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s00778-016-0448-z","volume":"26","author":"M Yang","year":"2016","unstructured":"Yang, M., Shkapsky, A., Zaniolo, C.: Scaling up the performance of more powerful Datalog systems on multicore machines. VLDB J. 26(2), 229\u2013248 (2016). \nhttps:\/\/doi.org\/10.1007\/s00778-016-0448-z","journal-title":"VLDB J."},{"issue":"5\u20136","key":"7_CR39","doi-asserted-by":"publisher","first-page":"1048","DOI":"10.1017\/S1471068417000436","volume":"17","author":"C Zaniolo","year":"2017","unstructured":"Zaniolo, C., Yang, M., Das, A., Shkapsky, A., Condie, T., Interlandi, M.: Fixpoint semantics and optimization of recursive Datalog programs with aggregates. Theory Pract. Log. Program. 17(5\u20136), 1048\u20131065 (2017). \nhttps:\/\/doi.org\/10.1017\/S1471068417000436","journal-title":"Theory Pract. Log. Program."}],"container-title":["Lecture Notes in Computer Science","Reasoning Web. Declarative Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-60067-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,17]],"date-time":"2020-10-17T10:06:04Z","timestamp":1602929164000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-60067-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030600662","9783030600679"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-60067-9_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"18 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Reasoning Web","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Reasoning Web International Summer School","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Oslo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Norway","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rweb2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2020.declarativeai.net\/events\/rw-summer-school","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}