{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T10:18:57Z","timestamp":1743157137373,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030294359"},{"type":"electronic","value":"9783030294366"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-29436-6_2","type":"book-chapter","created":{"date-parts":[[2019,8,20]],"date-time":"2019-08-20T16:04:02Z","timestamp":1566317042000},"page":"18-34","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Width of Regular Classes of Finite Structures"],"prefix":"10.1007","author":[{"given":"Alexsander","family":"Andrade de Melo","sequence":"first","affiliation":[]},{"given":"Mateus","family":"de Oliveira Oliveira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,20]]},"reference":[{"unstructured":"Blumensath, A.: Automatic structures. Diploma thesis. Rheinisch-Westf\u00e4lische Technische Hochschule Aachen (1999)","key":"2_CR1"},{"unstructured":"Blumensath, A., Gradel, E.: Automatic structures. In: Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science, pp. 51\u201362. IEEE (2000)","key":"2_CR2"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2011.11.029","volume":"447","author":"B Bollig","year":"2012","unstructured":"Bollig, B.: On symbolic OBDD-based algorithms for the minimum spanning tree problem. Theoret. Comput. Sci. 447, 2\u201312 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/978-3-319-12691-3_33","volume-title":"Combinatorial Optimization and Applications","author":"B Bollig","year":"2014","unstructured":"Bollig, B.: On the width of ordered binary decision diagrams. In: Zhang, Z., Wu, L., Xu, W., Du, D.-Z. (eds.) COCOA 2014. LNCS, vol. 8881, pp. 444\u2013458. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-12691-3_33"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.dam.2015.06.010","volume":"199","author":"F Bonomo","year":"2016","unstructured":"Bonomo, F., Grippo, L.N., Milani\u010d, M., Safe, M.D.: Graph classes with and without powers of bounded clique-width. Discrete Appl. Math. 199, 3\u201315 (2016)","journal-title":"Discrete Appl. Math."},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"JR B\u00fcchi","year":"1960","unstructured":"B\u00fcchi, J.R.: Weak second order arithmetic and finite automata. Z. Math. Logik Grundl. Math. 6, 66\u201392 (1960)","journal-title":"Z. Math. Logik Grundl. Math."},{"doi-asserted-by":"crossref","unstructured":"Bulatov, A.A.: Graphs of relational structures: restricted types. In: Proceedings of the 31st Annual ACM\/IEEE Symposium on Logic in Computer Science, pp. 642\u2013651. ACM (2016)","key":"2_CR7","DOI":"10.1145\/2933575.2933604"},{"issue":"3","key":"2_CR8","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/j.disc.2005.12.011","volume":"306","author":"LS Chandran","year":"2006","unstructured":"Chandran, L.S., Kavitha, T.: The treewidth and pathwidth of hypercubes. Discrete Math. 306(3), 359\u2013365 (2006)","journal-title":"Discrete Math."},{"issue":"1","key":"2_CR9","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inf. Comput. 85(1), 12\u201375 (1990)","journal-title":"Inf. Comput."},{"issue":"2","key":"2_CR10","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s002249910009","volume":"33","author":"B Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst. 33(2), 125\u2013150 (2000)","journal-title":"Theory Comput. Syst."},{"key":"2_CR11","volume-title":"Mathematical Logic","author":"HD Ebbinghaus","year":"2013","unstructured":"Ebbinghaus, H.D., Flum, J., Thomas, W.: Mathematical Logic. Springer, New York (2013)"},{"key":"2_CR12","volume-title":"Finite Model Theory","author":"HD Ebbinghaus","year":"2005","unstructured":"Ebbinghaus, H.D., Flum, J.: Finite Model Theory. Springer, Heidelberg (2005)"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1090\/S0002-9947-1961-0139530-9","volume":"98","author":"CC Elgot","year":"1961","unstructured":"Elgot, C.C.: Decision problems of finite automata and related arithmetics. Trans. Am. Math. Soc. 98, 21\u201352 (1961)","journal-title":"Trans. Am. Math. Soc."},{"issue":"3\u20134","key":"2_CR14","first-page":"291","volume":"38","author":"B Farb","year":"1992","unstructured":"Farb, B.: Automatic groups: a guided tour. Enseign. Math. (2) 38(3\u20134), 291\u2013313 (1992)","journal-title":"Enseign. Math. (2)"},{"doi-asserted-by":"crossref","unstructured":"Getoor, L., Friedman, N., Koller, D., Taskar, B.: Learning probabilistic models of relational structure. In: ICML, vol. 1, pp. 170\u2013177 (2001)","key":"2_CR15","DOI":"10.1007\/978-3-662-04599-2_13"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-540-92248-3_3","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M Grohe","year":"2008","unstructured":"Grohe, M.: Algorithmic meta theorems. In: Broersma, H., Erlebach, T., Friedetzky, T., Paulusma, D. (eds.) WG 2008. LNCS, vol. 5344, p. 30. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-92248-3_3"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-319-06686-8_2","volume-title":"Computer Science - Theory and Applications","author":"M Grohe","year":"2014","unstructured":"Grohe, M.: Algorithmic meta theorems for sparse graph classes. In: Hirsch, E.A., Kuznetsov, S.O., Pin, J.\u00c9., Vereshchagin, N.K. (eds.) CSR 2014. LNCS, vol. 8476, pp. 16\u201322. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06686-8_2"},{"unstructured":"Hachtel, G.D., Somenzi, F.: A symbolic algorithm for maximum flow in 0-1 networks. In: Proceedings of the 1993 IEEE\/ACM International Conference on Computer-Aided Design, pp. 403\u2013406. IEEE Computer Society Press (1993)","key":"2_CR18"},{"issue":"3","key":"2_CR19","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1016\/j.tcs.2005.10.006","volume":"351","author":"P Hlin\u011bn\u1ef3","year":"2006","unstructured":"Hlin\u011bn\u1ef3, P., Seese, D.: Trees, grids, and MSO decidability: from graphs to matroids. Theoret. Comput. Sci. 351(3), 372\u2013393 (2006)","journal-title":"Theoret. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Khoussainov, B., Minnes, M.: Three lectures on automatic structures. In: Proceedings of Logic Colloquium, pp. 132\u2013176 (2007)","key":"2_CR20","DOI":"10.1017\/CBO9780511778421.008"},{"key":"2_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/3-540-60178-3_93","volume-title":"Logic and Computational Complexity","author":"B Khoussainov","year":"1995","unstructured":"Khoussainov, B., Nerode, A.: Automatic presentations of structures. In: Leivant, D. (ed.) LCC 1994. LNCS, vol. 960, pp. 367\u2013392. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60178-3_93"},{"unstructured":"Kolaitis, P.G., Vardi, M.Y.: A game-theoretic approach to constraint satisfaction. In: AAAI\/IAAI, pp. 175\u2013181 (2000)","key":"2_CR22"},{"key":"2_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/978-3-540-79723-4_3","volume-title":"Parameterized and Exact Computation","author":"S Kreutzer","year":"2008","unstructured":"Kreutzer, S.: Algorithmic meta-theorems. In: Grohe, M., Niedermeier, R. (eds.) IWPEC 2008. LNCS, vol. 5018, pp. 10\u201312. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79723-4_3"},{"doi-asserted-by":"crossref","unstructured":"Kruckman, A., Rubin, S., Sheridan, J., Zax, B.: A Myhill-Nerode theorem for automata with advice. In: Proceedings of GANDALF 2012. Electronic Proceedings in Theoretical Computer Science, vol. 96, pp. 238\u2013246 (2012)","key":"2_CR24","DOI":"10.4204\/EPTCS.96.18"},{"unstructured":"Poon, H., Domingos, P.M., Sumner, M.: A general method for reducing the complexity of relational inference and its application to MCMC. In: AAAI, vol. 8, pp. 1075\u20131080 (2008)","key":"2_CR25"},{"key":"2_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-540-24618-3_26","volume-title":"SOFSEM 2004: Theory and Practice of Computer Science","author":"D Sawitzki","year":"2004","unstructured":"Sawitzki, D.: Implicit flow maximization by iterative squaring. In: Van Emde Boas, P., Pokorn\u00fd, J., Bielikov\u00e1, M., \u0160tuller, J. (eds.) SOFSEM 2004. LNCS, vol. 2932, pp. 301\u2013313. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24618-3_26"},{"issue":"2","key":"2_CR27","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0168-0072(91)90054-P","volume":"53","author":"D Seese","year":"1991","unstructured":"Seese, D.: The structure of the models of decidable monadic theories of graphs. Ann. Pure Appl. Log. 53(2), 169\u2013195 (1991)","journal-title":"Ann. Pure Appl. Log."},{"unstructured":"Sutskever, I., Tenenbaum, J.B., Salakhutdinov, R.R.: Modelling relational data using Bayesian clustered tensor factorization. In: Advances in Neural Information Processing Systems, pp. 1821\u20131828 (2009)","key":"2_CR28"},{"issue":"1","key":"2_CR29","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.jda.2005.01.008","volume":"4","author":"P Woelfel","year":"2006","unstructured":"Woelfel, P.: Symbolic topological sorting with OBDDs. J. Discrete Algorithms 4(1), 51\u201371 (2006)","journal-title":"J. Discrete Algorithms"},{"unstructured":"Zaid, F.A., Gr\u00e4del, E., Reinhardt, F.: Advice automatic structures and uniformly automatic classes. In: 26th EACSL Annual Conference on Computer Science Logic (CSL 2017). LIPIcs, vol. 82, pp. 35:1\u201335:20 (2017)","key":"2_CR30"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2013 CADE 27"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29436-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T21:53:34Z","timestamp":1657576414000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-29436-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030294359","9783030294366"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29436-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"20 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CADE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Automated Deduction","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Natal","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazil","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cade2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.mat.ufrn.br\/CADE-27\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}