{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T19:04:21Z","timestamp":1767035061221,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030500252"},{"type":"electronic","value":"9783030500269"}],"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-50026-9_21","type":"book-chapter","created":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T23:02:43Z","timestamp":1592780563000},"page":"289-302","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["The Subtrace Order and Counting First-Order Logic"],"prefix":"10.1007","author":[{"given":"Dietrich","family":"Kuske","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-663-09367-1","volume-title":"Transductions and Context-Free Languages","author":"J Berstel","year":"1979","unstructured":"Berstel, J.: Transductions and Context-Free Languages. Teubner Studienb\u00fccher, Stuttgart (1979)"},{"key":"21_CR2","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0079468","volume-title":"Problemes combinatoires de commutation et rearrangements","author":"P Cartier","year":"1969","unstructured":"Cartier, P., Foata, D.: Problemes combinatoires de commutation et rearrangements. Lecture Notes in Mathematics, vol. 85. Springer, Heidelberg (1969). \nhttps:\/\/doi.org\/10.1007\/BFb0079468"},{"key":"21_CR3","doi-asserted-by":"publisher","DOI":"10.1142\/2563","volume-title":"The Book of Traces","author":"V Diekert","year":"1995","unstructured":"Diekert, V., Rozenberg, G.: The Book of Traces. World Scientific Publ. Co., London (1995)"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A Finkel","year":"2001","unstructured":"Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere!. Theoret. Comput. Sci. 256, 63\u201392 (2001)","journal-title":"Theoret. Comput. Sci."},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Gastin, P., Petit, A.: Infinite traces. In: [3], pp. 393\u2013486 (1995)","DOI":"10.1142\/9789814261456_0011"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Halfon, S., Schnoebelen, Ph., Zetzsche, G.: Decidability, complexity, and expressiveness of first-order logic over the subword ordering. In: LICS 2017, pp. 1\u201312. IEEE Computer Society (2017)","DOI":"10.1109\/LICS.2017.8005141"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"2","author":"G Higman","year":"1952","unstructured":"Higman, G.: Ordering by divisibility in abstract algebras. Proc. London Math. Soc. 2, 326\u2013336 (1952)","journal-title":"Proc. London Math. Soc."},{"issue":"1","key":"21_CR8","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s00012-009-0002-6","volume":"61","author":"J Je\u017eek","year":"2009","unstructured":"Je\u017eek, J., McKenzie, R.: Definability in substructure orderings. I: finite semilattices. Algebra Univers. 61(1), 59\u201375 (2009)","journal-title":"Algebra Univers."},{"key":"21_CR9","unstructured":"Karandikar, P., Schnoebelen, Ph.: Decidability in the logic of subsequences and supersequences. In: FSTTCS 2015, Leibniz International Proceedings in Informatics, vol. 45, pp. 84\u201397. Leibniz-Zentrum f\u00fcr Informatik (2015)"},{"issue":"2","key":"21_CR10","first-page":"6:1","volume":"15","author":"P Karandikar","year":"2019","unstructured":"Karandikar, P., Schnoebelen, P.: The height of piecewise-testable languages and the complexity of the logic of subwords. Log. Methods Comput. Sci. 15(2), 6:1\u20136:27 (2019)","journal-title":"Log. Methods Comput. Sci."},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-642-13962-8_28","volume-title":"Programs, Proofs, Processes","author":"OV Kudinov","year":"2010","unstructured":"Kudinov, O.V., Selivanov, V.L., Yartseva, L.V.: Definability in the subword order. In: Ferreira, F., L\u00f6we, B., Mayordomo, E., Mendes Gomes, L. (eds.) CiE 2010. LNCS, vol. 6158, pp. 246\u2013255. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-13962-8_28"},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1051\/ita:2005039","volume":"40","author":"D Kuske","year":"2006","unstructured":"Kuske, D.: Theories of orders on the set of words. Theoret. Inf. Appl. 40, 53\u201374 (2006)","journal-title":"Theoret. Inf. Appl."},{"key":"21_CR13","unstructured":"Kuske, D., Schwarz, Ch.: Complexity of counting first-order logic for the subword order (2020, in preparation)"},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-030-17127-8_20","volume-title":"Foundations of Software Science and Computation Structures","author":"D Kuske","year":"2019","unstructured":"Kuske, D., Zetzsche, G.: Languages ordered by the subword order. In: Boja\u0144czyk, M., Simpson, A. (eds.) FoSSaCS 2019. LNCS, vol. 11425, pp. 348\u2013364. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-17127-8_20"},{"key":"21_CR15","unstructured":"Madhusudan, P.: Model-checking trace event structures. In: LICS 2003, pp. 371\u2013380. IEEE Computer Society Press (2003)"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Mazurkiewicz, A.: Concurrent program schemes and their interpretation. Technical report, DAIMI Report PB-78, Aarhus University (1977)","DOI":"10.7146\/dpb.v6i78.7691"},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"1343","DOI":"10.2140\/pjm.1964.14.1343","volume":"XIV","author":"J McKnight","year":"1964","unstructured":"McKnight, J.: Kleene\u2019s quotient theorems. Pac. J. Math. XIV, 1343\u20131352 (1964)","journal-title":"Pac. J. Math."},{"key":"21_CR18","doi-asserted-by":"publisher","first-page":"379","DOI":"10.2307\/1971037","volume":"102","author":"S Shelah","year":"1975","unstructured":"Shelah, S.: The monadic theory of order. Ann. Math. 102, 379\u2013419 (1975)","journal-title":"Ann. Math."},{"issue":"3","key":"21_CR19","first-page":"1","volume":"14","author":"RS Thinniyam","year":"2018","unstructured":"Thinniyam, R.S.: Defining recursive predicates in graph orders. Log. Methods Comput. Sci. 14(3), 1\u201338 (2018)","journal-title":"Log. Methods Comput. Sci."},{"key":"21_CR20","unstructured":"Thomas, W.: On logical definability of trace languages. In: Diekert, V. (ed.) Proceedings of a workshop of the ESPRIT BRA No 3166: Algebraic and Syntactic Methods in Computer Science (ASMICS) 1989, Report TUM-I9002, Technical University of Munich, pp. 172\u2013182 (1990)"},{"issue":"1","key":"21_CR21","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s00026-015-0295-4","volume":"20","author":"A Wires","year":"2016","unstructured":"Wires, A.: Definability in the substructure ordering of simple graphs. Ann. Comb. 20(1), 139\u2013176 (2016). \nhttps:\/\/doi.org\/10.1007\/s00026-015-0295-4","journal-title":"Ann. Comb."}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-50026-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T23:07:25Z","timestamp":1592780845000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-50026-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030500252","9783030500269"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-50026-9_21","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":"22 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Yekaterinburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","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":"29 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/csr2020.sciencesconf.org\/","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":"49","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":"25","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":"51% - 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":"7","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)"}},{"value":"The conference was cancelled as a live conference due to the corona pandemic.","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)"}}]}}