{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:50:40Z","timestamp":1742914240598,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031455575"},{"type":"electronic","value":"9783031455582"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-45558-2_9","type":"book-chapter","created":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T14:02:43Z","timestamp":1698069763000},"page":"109-125","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Expressive Power of\u00a0Revised Datalog on\u00a0Problems with\u00a0Closure Properties"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5110-3881","authenticated-orcid":false,"given":"Shiguang","family":"Feng","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,10,24]]},"reference":[{"key":"9_CR1","volume-title":"Foundations of Databases","author":"S Abiteboul","year":"1995","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Boston (1995)"},{"issue":"1","key":"9_CR2","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/0022-0000(91)90032-Z","volume":"43","author":"S Abiteboul","year":"1991","unstructured":"Abiteboul, S., Vianu, V.: Datalog extensions for database queries and updates. J. Comput. Syst. Sci. 43(1), 62\u2013124 (1991)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"9_CR3","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1006\/jcss.1995.1060","volume":"51","author":"FN Afrati","year":"1995","unstructured":"Afrati, F.N., Cosmadakis, S.S., Yannakakis, M.: On datalog vs polynomial time. J. Comput. Syst. Sci. 51(2), 177\u2013196 (1995)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"9_CR4","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1016\/S0022-0000(05)80071-6","volume":"49","author":"M Ajtai","year":"1994","unstructured":"Ajtai, M., Gurevich, Y.: Datalog vs first-order logic. J. Comput. Syst. Sci. 49(3), 562\u2013588 (1994)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"9_CR5","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)","journal-title":"ACM Comput. Surv."},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-540-70583-3_14","volume-title":"Automata, Languages and Programming","author":"A Dawar","year":"2008","unstructured":"Dawar, A., Kreutzer, S.: On datalog vs. LFP. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5126, pp. 160\u2013171. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70583-3_14"},{"key":"9_CR7","unstructured":"Dawar, A., Sankaran, A.: Extension preservation in the finite and prefix classes of first order logic. In: Baier, C., Goubault-Larrecq, J. (eds.) 29th EACSL Annual Conference on Computer Science Logic, CSL 2021, 25\u201328 January 2021, Ljubljana, Slovenia. LIPIcs, vol. 183, pp. 18:1\u201318:13. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"9_CR8","volume-title":"Principles of Data Integration","author":"A Doan","year":"2012","unstructured":"Doan, A., Halevy, A., Ives, Z.: Principles of Data Integration. Elsevier, Amsterdam (2012)"},{"key":"9_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-28788-4","volume-title":"Finite Model Theory","author":"HD Ebbinghaus","year":"1995","unstructured":"Ebbinghaus, H.D., Flum, J.: Finite Model Theory. Springer-Verlag, Berlin (1995)"},{"issue":"1","key":"9_CR10","first-page":"11","volume":"5","author":"S Feng","year":"2012","unstructured":"Feng, S., Zhao, X.: The complexity and expressive power of second-order extended logic. Stud. Logic 5(1), 11\u201334 (2012)","journal-title":"Stud. Logic"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Fernandes, A.A., Paton, N.W.: Databases. In: Meyers, R.A. (ed.) Encyclopedia of Physical Science and Technology (Third Edition), pp. 213\u2013228. Academic Press, New York (2003)","DOI":"10.1016\/B0-12-227410-5\/00844-9"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/BFb0020821","volume-title":"STACS 91","author":"E Gr\u00e4del","year":"1991","unstructured":"Gr\u00e4del, E.: The expressive power of second order horn logic. In: Choffrut, C., Jantzen, M. (eds.) STACS 1991. LNCS, vol. 480, pp. 466\u2013477. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/BFb0020821"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/978-3-642-32925-8_2","volume-title":"Datalog in Academia and Industry","author":"Y Gurevich","year":"2012","unstructured":"Gurevich, Y.: Datalog: a perspective and the potential. In: Barcel\u00f3, P., Pichler, R. (eds.) Datalog 2.0 2012. LNCS, vol. 7494, pp. 9\u201320. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32925-8_2"},{"issue":"3","key":"9_CR14","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/0022-0000(81)90039-8","volume":"22","author":"N Immerman","year":"1981","unstructured":"Immerman, N.: Number of quantifiers is better than number of tape cells. J. Comput. Syst. Sci. 22(3), 384\u2013406 (1981)","journal-title":"J. Comput. Syst. Sci."},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Immerman, N.: Relational queries computable in polynomial time. In: Fourteenth Annual ACM Symposium on Theory of Computing. pp. 147\u2013152. ACM (1982)","DOI":"10.1145\/800070.802187"},{"key":"9_CR16","unstructured":"Ketsman, B., Koch, C.: Datalog with negation and monotonicity. In: Lutz, C., Jung, J. (eds.) 23rd International Conference on Database Theory, ICDT 2020. Leibniz International Proceedings in Informatics, LIPIcs, Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing (2020)"},{"issue":"1","key":"9_CR17","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0304-3975(91)90048-7","volume":"85","author":"S Lindell","year":"1991","unstructured":"Lindell, S.: An analysis of fixed-point queries on binary trees. Theoret. Comput. Sci. 85(1), 75\u201395 (1991)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Marinescu, D.C.: Chapter 6 - cloud data storage. In: Marinescu, D.C. (ed.) Cloud Computing (Second Edition), pp. 195\u2013233. Morgan Kaufmann (2018)","DOI":"10.1016\/B978-0-12-812810-7.00008-X"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BFb0035010","volume-title":"Semantics in Databases","author":"PZ Revesz","year":"1997","unstructured":"Revesz, P.Z.: Constraint databases: a survey. In: Thalheim, B., Libkin, L. (eds.) SiD 1995. LNCS, vol. 1358, pp. 209\u2013246. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0035010"},{"key":"9_CR20","unstructured":"Rosen, E.: Finite Model Theory and Finite Variable Logics. Ph.D. thesis, University of Pennsylvania (1995)"},{"key":"9_CR21","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/BF01536398","volume":"15","author":"JS Schlipf","year":"1995","unstructured":"Schlipf, J.S.: Complexity and undecidability results for logic programming. Ann. Math. Artif. Intell. 15, 257\u2013288 (1995)","journal-title":"Ann. Math. Artif. Intell."},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Shmueli, O.: Decidability and expressiveness aspects of logic queries. In: Proceedings of the Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, PODS 1987, pp. 237\u2013249. Association for Computing Machinery, New York (1987)","DOI":"10.1145\/28659.28685"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Siekmann, J.H.: Computational Logic, Handbook of the History of Logic, vol. 9. North Holland (2014)","DOI":"10.1016\/B978-0-444-51624-4.50001-0"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: The complexity of relational query languages. In: Fourteenth Annual ACM Symposium on Theory of Computing, pp. 137\u2013146. ACM (1982)","DOI":"10.1145\/800070.802186"}],"container-title":["Lecture Notes in Computer Science","Logic, Rationality, and Interaction"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-45558-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T14:03:37Z","timestamp":1698069817000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-45558-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031455575","9783031455582"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-45558-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"24 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LORI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Logic, Rationality and Interaction","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jinan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lori2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/golori.org\/lori2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"53% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}