{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:21:50Z","timestamp":1740122510565,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,11,12]],"date-time":"2022-11-12T00:00:00Z","timestamp":1668211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,12]],"date-time":"2022-11-12T00:00:00Z","timestamp":1668211200000},"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":["J of Log Lang and Inf"],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s10849-022-09384-9","type":"journal-article","created":{"date-parts":[[2022,11,12]],"date-time":"2022-11-12T13:29:36Z","timestamp":1668259776000},"page":"147-174","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Feferman\u2013Vaught Decompositions for Prefix Classes of First Order Logic"],"prefix":"10.1007","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4474-3562","authenticated-orcid":false,"given":"Abhisekh","family":"Sankaran","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,12]]},"reference":[{"key":"9384_CR1","first-page":"73","volume":"2","author":"A Blumensath","year":"2008","unstructured":"Blumensath, A., Colcombet, T., & L\u00f6ding, C. (2008). Logical theories and compatible operations. Logic and Automata, 2, 73\u2013106.","journal-title":"Logic and Automata"},{"issue":"2","key":"9384_CR2","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. (2000). Linear time solvable optimization problems on graphs of bounded clique-width. Theory of Computing Systems, 33(2), 125\u2013150.","journal-title":"Theory of Computing Systems"},{"key":"9384_CR3","doi-asserted-by":"crossref","unstructured":"Dawar, A., Grohe, M., Kreutzer, S., & Schweikardt, N. (2007). Model theory makes formulas large. In International Colloquium on Automata, Languages, and Programming (pp. 913\u2013924).","DOI":"10.1007\/978-3-540-73420-8_78"},{"key":"9384_CR4","unstructured":"Droste, M., & Paul, E. (2018). A feferman-vaught decomposition theorem for weighted mso logic. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"issue":"4","key":"9384_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2946799","volume":"17","author":"M Elberfeld","year":"2016","unstructured":"Elberfeld, M., Grohe, M., & Tantau, T. (2016). Where first-order and monadic second-order logic coincide. ACM Transactions on Computational Logic (TOCL), 17(4), 1\u201318.","journal-title":"ACM Transactions on Computational Logic (TOCL)"},{"key":"9384_CR6","unstructured":"Emmer, M., Khasidashvili, Z., Korovin, K., & Voronkov, A. (2010). Encoding industrial hardware verification problems into effectively propositional logic. In Proceedings of Formal Methods in Computer Aided Design, FMCAD 2010, Lugano, Switzerland, October 20\u201323, 2010 (pp. 137\u2013144)."},{"issue":"1","key":"9384_CR7","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.tcs.2004.10.033","volume":"336","author":"R Fagin","year":"2005","unstructured":"Fagin, R., Kolaitis, P. G., Miller, R. J., & Popa, L. (2005). Data exchange: Semantics and query answering. Theoretical Computer Science, 336(1), 89\u2013124.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"9384_CR8","doi-asserted-by":"publisher","first-page":"57","DOI":"10.4064\/fm-47-1-57-103","volume":"47","author":"S Feferman","year":"1959","unstructured":"Feferman, S., & Vaught, R. (1959). The first order properties of products of algebraic systems. Fundamenta Mathematicae, 47(1), 57\u2013103.","journal-title":"Fundamenta Mathematicae"},{"issue":"1\u20133","key":"9384_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.apal.2004.01.007","volume":"130","author":"M Frick","year":"2004","unstructured":"Frick, M., & Grohe, M. (2004). The complexity of first-order and monadic second-order logic revisited. Annals of Pure and Applied Logic, 130(1\u20133), 3\u201331.","journal-title":"Annals of Pure and Applied Logic"},{"issue":"1","key":"9384_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2699918","volume":"16","author":"S G\u00f6ller","year":"2015","unstructured":"G\u00f6ller, S., Jung, J. C., & Lohrey, M. (2015). The complexity of decomposing modal and first-order theories. ACM Transactions on Computational Logic (TOCL), 16(1), 1\u201343.","journal-title":"ACM Transactions on Computational Logic (TOCL)"},{"key":"9384_CR11","first-page":"357","volume":"2","author":"M Grohe","year":"2008","unstructured":"Grohe, M. (2008). Logic, graphs, and algorithms. Logic and Automata, 2, 357\u2013422.","journal-title":"Logic and Automata"},{"key":"9384_CR12","doi-asserted-by":"crossref","unstructured":"Gulwani, S. (2010). Dimensions in program synthesis. In Proceedings of the 12th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming, ACM, PPDP \u201910 (pp 13\u201324).","DOI":"10.1145\/1836089.1836091"},{"key":"9384_CR13","doi-asserted-by":"crossref","unstructured":"Haase, C. (2014). Subclasses of Presburger arithmetic and the weak EXP hierarchy. In Proceedings of the joint meeting of the 23rd EACSL annual conference on computer science logic (CSL) and the 29th annual ACM\/IEEE symposium on logic in computer science (LICS) (pp. 1\u201310).","DOI":"10.1145\/2603088.2603092"},{"issue":"7","key":"9384_CR14","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/j.ipl.2016.03.005","volume":"116","author":"F Harwath","year":"2016","unstructured":"Harwath, F. (2016). A note on the size of Prenex normal forms. Information Processing Letters, 116(7), 443\u2013446.","journal-title":"Information Processing Letters"},{"issue":"4","key":"9384_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-11(4:17)2015","volume":"11","author":"F Harwath","year":"2015","unstructured":"Harwath, F., Heimberg, L., & Schweikardt, N. (2015). Preservation and decomposition theorems for bounded degree structures. Logical Methods in Computer Science, 11(4), 1. https:\/\/doi.org\/10.2168\/LMCS-11(4:17)2015","journal-title":"Logical Methods in Computer Science"},{"key":"9384_CR16","doi-asserted-by":"crossref","unstructured":"Lenzerini, M. (2002). Data integration: A theoretical perspective. In Proceedings of the 21st ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems, ACM, PODS \u201902 (pp. 233\u2013246).","DOI":"10.1145\/543613.543644"},{"key":"9384_CR17","unstructured":"Libkin, L. (2013). Elements of finite model theory. Springer."},{"issue":"1\u20133","key":"9384_CR18","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.apal.2003.11.002","volume":"126","author":"JA Makowsky","year":"2004","unstructured":"Makowsky, J. A. (2004). Algorithmic uses of the Feferman\u2013Vaught theorem. Annals of Pure and Applied Logic, 126(1\u20133), 159\u2013213.","journal-title":"Annals of Pure and Applied Logic"},{"issue":"1","key":"9384_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2267454","volume":"17","author":"A Mostowski","year":"1952","unstructured":"Mostowski, A. (1952). On direct products of theories. The Journal of Symbolic Logic, 17(1), 1\u201331.","journal-title":"The Journal of Symbolic Logic"},{"issue":"4","key":"9384_CR20","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s10817-009-9161-6","volume":"44","author":"R Piskac","year":"2010","unstructured":"Piskac, R., de Moura, L. M., & Bj\u00f8rner, N. (2010). Deciding effectively propositional logic using DPLL and substitution sets. Journal of Automated Reasoning, 44(4), 401\u2013424.","journal-title":"Journal of Automated Reasoning"},{"key":"9384_CR21","doi-asserted-by":"crossref","unstructured":"Reddy, C. R., & Loveland, D. W. (1978). Presburger arithmetic with bounded quantifier alternation. In Proceedings of the 10th annual ACM symposium on theory of computing (pp. 320\u2013325).","DOI":"10.1145\/800133.804361"},{"key":"9384_CR22","unstructured":"Sankaran, A. (2018). A generalization of the \u0141o\u015b\u2013Tarski preservation theorem\u2014Dissertation summary. arXiv:1811.01014"},{"key":"9384_CR23","unstructured":"Sankaran, A. (2021). Feferman\u2013Vaught decompositions for prefix classes of first order logic. In ICLA 2021 Proceedings, 9th Indian Conference on Logic and its Applications (pp. 111\u2013116). March 4\u20137, 2021. https:\/\/www.isichennai.res.in\/~sujata\/icla2021\/proceedings.pdf."},{"key":"9384_CR24","doi-asserted-by":"crossref","unstructured":"Stockmeyer, L. J., & Meyer, A. R. (1973). Word problems requiring exponential time (preliminary report). In Proceedings of the 5th annual ACM symposium on theory of computing, association for computing machinery, New York, NY, USA, STOC \u201973 (p. 1\u20139).","DOI":"10.1145\/800125.804029"},{"key":"9384_CR25","doi-asserted-by":"crossref","unstructured":"Thomas, W. (1997). Ehrenfeucht games, the composition method, and the monadic theory of ordinal words. In Structures in logic and computer science, a selection of essays in honor of A. Ehrenfeucht, number 1261 in lecture notes in computer science (pp. 118\u2013143). Springer.","DOI":"10.1007\/3-540-63246-8_8"},{"key":"9384_CR26","unstructured":"van Bergerem, S., & Schweikardt, N. (2021). Learning concepts described by weight aggregation logic. In Baier, C., Goubault-Larrecq, J. (Eds) 29th EACSL Annual Conference on Computer Science Logic, CSL 2021, January 25\u201328, 2021, Ljubljana, Slovenia (Virtual Conference), Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, LIPIcs (Vol. 183, pp. 10:1\u201310:18)."},{"issue":"2\u20133","key":"9384_CR27","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0166-218X(94)90026-4","volume":"54","author":"E Wanke","year":"1994","unstructured":"Wanke, E. (1994). k-nlc graphs and polynomial algorithms. Discrete Applied Mathematics, 54(2\u20133), 251\u2013266.","journal-title":"Discrete Applied Mathematics"}],"container-title":["Journal of Logic, Language and Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10849-022-09384-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10849-022-09384-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10849-022-09384-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T12:10:46Z","timestamp":1676635846000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10849-022-09384-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,12]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["9384"],"URL":"https:\/\/doi.org\/10.1007\/s10849-022-09384-9","relation":{},"ISSN":["0925-8531","1572-9583"],"issn-type":[{"type":"print","value":"0925-8531"},{"type":"electronic","value":"1572-9583"}],"subject":[],"published":{"date-parts":[[2022,11,12]]},"assertion":[{"value":"1 July 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 November 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}