{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:35:09Z","timestamp":1742913309877,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030406073"},{"type":"electronic","value":"9783030406080"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-40608-0_14","type":"book-chapter","created":{"date-parts":[[2020,2,25]],"date-time":"2020-02-25T00:07:34Z","timestamp":1582589254000},"page":"208-221","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Pebble-Intervals Automata and FO$$^2$$ with Two Orders"],"prefix":"10.1007","author":[{"given":"Nadia","family":"Labai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomer","family":"Kotek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Magdalena","family":"Ortiz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Helmut","family":"Veith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,25]]},"reference":[{"issue":"4","key":"14_CR1","doi-asserted-by":"publisher","first-page":"27:1","DOI":"10.1145\/3143803","volume":"18","author":"S Ahmetaj","year":"2017","unstructured":"Ahmetaj, S., Calvanese, D., Ortiz, M., Simkus, M.: Managing change in graph-structured data using description logics. ACM Trans. Comput. Logic 18(4), 27:1\u201327:35 (2017)","journal-title":"ACM Trans. Comput. Logic"},{"issue":"4\u20135","key":"14_CR2","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1016\/j.tcs.2009.10.009","volume":"411","author":"H Bj\u00f6rklund","year":"2010","unstructured":"Bj\u00f6rklund, H., Schwentick, T.: On notions of regularity for data languages. Theor. Comput. Sci. 411(4\u20135), 702\u2013715 (2010)","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Boja\u0144czyk, M., David, C., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data trees and XML reasoning. In: PODS, pp. 10\u201319. ACM (2006)","key":"14_CR3","DOI":"10.1145\/1142351.1142354"},{"issue":"4","key":"14_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/1970398.1970403","volume":"12","author":"M Boja\u0144czyk","year":"2011","unstructured":"Boja\u0144czyk, M., David, C., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data words. TOCL 12(4), 27 (2011)","journal-title":"TOCL"},{"doi-asserted-by":"crossref","unstructured":"Boja\u0144czyk, M., Muscholl, A., Schwentick, T., Segoufin, L., David, C.: Two-variable logic on words with data. In: LICS, pp. 7\u201316. IEEE (2006)","key":"14_CR5","DOI":"10.1109\/LICS.2006.51"},{"issue":"2","key":"14_CR6","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0890-5401(03)00038-5","volume":"182","author":"P Bouyer","year":"2003","unstructured":"Bouyer, P., Petit, A., Th\u00e9rien, D.: An algebraic approach to data languages and timed languages. Inf. Comput. 182(2), 137\u2013162 (2003)","journal-title":"Inf. Comput."},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-10181-1_1","volume-title":"Integrated Formal Methods","author":"D Calvanese","year":"2014","unstructured":"Calvanese, D., Kotek, T., \u0160imkus, M., Veith, H., Zuleger, F.: Shape and content. In: Albert, E., Sekerinski, E. (eds.) IFM 2014. LNCS, vol. 8739, pp. 3\u201317. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10181-1_1"},{"unstructured":"Calvanese, D., Ortiz, M., Simkus, M.: Verification of evolving graph-structured data under expressive path constraints. In: ICDT, pp. 15:1\u201315:19 (2016)","key":"14_CR8"},{"key":"14_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10575-8","volume-title":"Handbook of Model Checking","year":"2018","unstructured":"Clarke, E., Henzinger, T.A., Veith, H., Bloem, R. (eds.): Handbook of Model Checking. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-10575-8"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-642-16242-8_18","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"C David","year":"2010","unstructured":"David, C., Libkin, L., Tan, T.: On the satisfiability of two-variable logic over data words. In: Ferm\u00fcller, C.G., Voronkov, A. (eds.) LPAR 2010. LNCS, vol. 6397, pp. 248\u2013262. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16242-8_18"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/3-540-65306-6_20","volume-title":"Lectures on Petri Nets I: Basic Models","author":"J Esparza","year":"1998","unstructured":"Esparza, J.: Decidability and complexity of Petri net problems \u2014 an introduction. In: Reisig, W., Rozenberg, G. (eds.) ACPN 1996. LNCS, vol. 1491, pp. 374\u2013428. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-65306-6_20"},{"issue":"2","key":"14_CR12","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1006\/inco.2001.2953","volume":"179","author":"K Etessami","year":"2002","unstructured":"Etessami, K., Vardi, M., Wilke, T.: First-order logic with two variables and unary temporal logic. Inform. Comput. 179(2), 279\u2013295 (2002)","journal-title":"Inform. Comput."},{"issue":"01","key":"14_CR13","doi-asserted-by":"publisher","first-page":"53","DOI":"10.2307\/421196","volume":"3","author":"E Gr\u00e4del","year":"1997","unstructured":"Gr\u00e4del, E., Kolaitis, P., Vardi, M.: On the decision problem for two-variable first-order logic. Bull. Symb. Log. 3(01), 53\u201369 (1997)","journal-title":"Bull. Symb. Log."},{"issue":"1","key":"14_CR14","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0304-3975(98)00308-9","volume":"224","author":"E Gr\u00e4del","year":"1999","unstructured":"Gr\u00e4del, E., Otto, M.: On logics with two variables. Theor. Comput. Sci. 224(1), 73\u2013113 (1999)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/978-3-642-13089-2_47","volume-title":"Language and Automata Theory and Applications","author":"O Grumberg","year":"2010","unstructured":"Grumberg, O., Kupferman, O., Sheinvald, S.: Variable automata over infinite alphabets. In: Dediu, A.-H., Fernau, H., Mart\u00edn-Vide, C. (eds.) LATA 2010. LNCS, vol. 6031, pp. 561\u2013572. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13089-2_47"},{"unstructured":"Itzhaky, S., et al.: On the automated verification of web applications with embedded SQL. In: ICDT. LIPIcs, vol. 68, pp. 16:1\u201316:18 (2017)","key":"14_CR16"},{"issue":"2","key":"14_CR17","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0304-3975(94)90242-9","volume":"134","author":"M Kaminski","year":"1994","unstructured":"Kaminski, M., Francez, N.: Finite-memory automata. Theor. Comput. Sci. 134(2), 329\u2013363 (1994)","journal-title":"Theor. Comput. Sci."},{"unstructured":"Kara, A.: Logics on data words. Ph.D. thesis, Technical University of Dortmund (2016)","key":"14_CR18"},{"unstructured":"Manuel, A., Zeume, T.: Two-variable logic on 2-dimensional structures. In: CSL, pp. 484\u2013499 (2013)","key":"14_CR19"},{"issue":"7","key":"14_CR20","doi-asserted-by":"publisher","first-page":"1555","DOI":"10.1142\/S0129054112500244","volume":"23","author":"A Meduna","year":"2012","unstructured":"Meduna, A., Zemek, P.: Jumping finite automata. Int. J. Found. Comput. Sci. 23(7), 1555\u20131578 (2012)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1","key":"14_CR21","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1002\/malq.19750210118","volume":"21","author":"M Mortimer","year":"1975","unstructured":"Mortimer, M.: On languages with two variables. Math. Log. Q. 21(1), 135\u2013140 (1975)","journal-title":"Math. Log. Q."},{"issue":"3","key":"14_CR22","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1145\/1013560.1013562","volume":"5","author":"F Neven","year":"2004","unstructured":"Neven, F., Schwentick, T., Vianu, V.: Finite state machines for strings over infinite alphabets. TOCL 5(3), 403\u2013435 (2004)","journal-title":"TOCL"},{"doi-asserted-by":"crossref","unstructured":"Niewerth, M., Schwentick, T.: Two-variable logic and key constraints on data words. In: ICDT, pp. 138\u2013149. ACM (2011)","key":"14_CR23","DOI":"10.1145\/1938551.1938571"},{"issue":"2","key":"14_CR24","doi-asserted-by":"publisher","first-page":"685","DOI":"10.2307\/2695037","volume":"66","author":"M Otto","year":"2001","unstructured":"Otto, M.: Two variable first-order logic over ordered domains. J. Symb. Logic 66(2), 685\u2013702 (2001)","journal-title":"J. Symb. Logic"},{"doi-asserted-by":"crossref","unstructured":"Pratt-Hartmann, I.: Logics with counting and equivalence. In: CSL-LICS, pp. 76:1\u201376:10. ACM (2014)","key":"14_CR25","DOI":"10.1145\/2603088.2603117"},{"key":"14_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-540-24725-8_28","volume-title":"Programming Languages and Systems","author":"A Rensink","year":"2004","unstructured":"Rensink, A.: Canonical graph shapes. In: Schmidt, D. (ed.) ESOP 2004. LNCS, vol. 2986, pp. 401\u2013415. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24725-8_28"},{"doi-asserted-by":"crossref","unstructured":"Schwentick, T., Zeume, T.: Two-variable logic with two order relations. Log. Meth. Comput. Sci. 8(1) (2012)","key":"14_CR27","DOI":"10.2168\/LMCS-8(1:15)2012"},{"key":"14_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/11874683_3","volume-title":"Computer Science Logic","author":"L Segoufin","year":"2006","unstructured":"Segoufin, L.: Automata and logics for words and trees over an infinite alphabet. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol. 4207, pp. 41\u201357. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11874683_3"},{"issue":"1","key":"14_CR29","doi-asserted-by":"publisher","first-page":"8:1","DOI":"10.1145\/2559945","volume":"15","author":"T Tan","year":"2014","unstructured":"Tan, T.: Extending two-variable logic on data trees with order on data values and its automata. ACM Trans. Comput. Log. 15(1), 8:1\u20138:39 (2014)","journal-title":"ACM Trans. Comput. Log."},{"unstructured":"Vardi, M., Wolper, P.: An automata-theoretic approach to automatic program verification (preliminary report). In: LICS, pp. 332\u2013344. IEEE (1986)","key":"14_CR30"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-40608-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,8]],"date-time":"2025-03-08T20:42:30Z","timestamp":1741466550000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-40608-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030406073","9783030406080"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-40608-0_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"25 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Language and Automata Theory and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Milan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"4 March 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 March 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lata2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lata2020.irdta.eu\/","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":"59","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":"26","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":"0","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":"44% - 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":"4","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"In addition, there are 6 invited papers. Due to the coronavirus pandemic the actual conference was postponed to be held together with LATA 2021.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}