{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T20:14:15Z","timestamp":1758053655510,"version":"3.44.0"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032041661","type":"print"},{"value":"9783032041678","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,15]],"date-time":"2025-09-15T00:00:00Z","timestamp":1757894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,9,15]],"date-time":"2025-09-15T00:00:00Z","timestamp":1757894400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Optimization Modulo Theories (OMT) extends Satisfiability Modulo Theories (SMT) with the task of optimizing some objective function(s). In OMT solvers, a CDCL-based SMT solver enumerates theory-satisfiable total truth assignments, and a theory-specific procedure finds an optimum model for each of them; the current optimum is then used to tighten the search space for the next assignments, until no better solution is found.<\/jats:p>\n          <jats:p>In this paper, we analyze the role of truth-assignment enumeration in OMT. First, we spotlight that the enumeration of <jats:italic>total<\/jats:italic> truth assignments is suboptimal, since they may over-restrict the search space for the optimization procedure, whereas using <jats:italic>partial<\/jats:italic> truth assignments instead can improve the effectiveness of the optimization. Second, we propose some assignment-reduction techniques for exploiting <jats:italic>partial-assignment enumeration<\/jats:italic> within the OMT context. We implemented these techniques in the <jats:sc>OptiMathSAT<\/jats:sc> solver, and we conducted an experimental evaluation on <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$\\text {OMT}$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>OMT<\/mml:mi>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula> benchmarks. The results confirm the improvement in both the efficiency of optimal solving and the quality of the obtained solutions for anytime solving.<\/jats:p>","DOI":"10.1007\/978-3-032-04167-8_7","type":"book-chapter","created":{"date-parts":[[2025,9,14]],"date-time":"2025-09-14T22:03:57Z","timestamp":1757887437000},"page":"117-134","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Exploiting Partial-Assignment Enumeration in\u00a0Optimization Modulo Theories"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8842-4913","authenticated-orcid":false,"given":"Gabriele","family":"Masina","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0989-6101","authenticated-orcid":false,"given":"Roberto","family":"Sebastiani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,9,15]]},"reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-030-45237-7_7","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E Albert","year":"2020","unstructured":"Albert, E., Correas, J., Gordillo, P., Rom\u00e1n-D\u00edez, G., Rubio, A.: GASOL: gas analysis and optimization for Ethereum smart contracts. In: TACAS 2020. LNCS, vol. 12079, pp. 118\u2013125. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45237-7_7"},{"key":"7_CR2","doi-asserted-by":"publisher","unstructured":"Barrett, C., Sebastiani, R., Seshia, S.A., Tinelli, C.: Satisfiability modulo theories. In: Handbook of Satisfiability, FAIA, vol.\u00a0336, pp. 1267\u20131329, 2 edn. IOS Press (2021). https:\/\/doi.org\/10.3233\/FAIA201017","DOI":"10.3233\/FAIA201017"},{"key":"7_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2020.104609","volume":"275","author":"Z Bian","year":"2020","unstructured":"Bian, Z., Chudak, F., Macready, W., Roy, A., Sebastiani, R., Varotti, S.: Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results. Inf. Comput. 275, 104609 (2020). https:\/\/doi.org\/10.1016\/j.ic.2020.104609","journal-title":"Inf. Comput."},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-030-86205-3_12","volume-title":"Frontiers of Combining Systems","author":"F Bigarella","year":"2021","unstructured":"Bigarella, F., et al.: Optimization modulo non-linear arithmetic via incremental linearization. In: Konev, B., Reger, G. (eds.) FroCoS 2021. LNCS (LNAI), vol. 12941, pp. 213\u2013231. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-86205-3_12"},{"key":"7_CR5","doi-asserted-by":"publisher","unstructured":"Bj\u00f8rner, N., Phan, A.D.: $$\\nu $$Z - maximal satisfaction with Z3. In: Proceedings of the International Symposium on Symbolic Computation in Software Science, pp.\u00a01\u20139 (2014). https:\/\/doi.org\/10.29007\/jmxj","DOI":"10.29007\/jmxj"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-662-46681-0_14","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"N Bj\u00f8rner","year":"2015","unstructured":"Bj\u00f8rner, N., Phan, A.-D., Fleckenstein, L.: $$\\nu $$Z - an optimizing SMT solver. In: Baier, C., Tinelli, C. (eds.) TACAS 2015. LNCS, vol. 9035, pp. 194\u2013199. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46681-0_14"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-319-66158-2_5","volume-title":"Principles and Practice of Constraint Programming","author":"M Bofill","year":"2017","unstructured":"Bofill, M., Coll, J., Suy, J., Villaret, M.: An efficient SMT approach to solve MRCPSP\/max instances with tight constraints on resources. In: Beck, J.C. (ed.) CP 2017. LNCS, vol. 10416, pp. 71\u201379. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66158-2_5"},{"issue":"10","key":"7_CR8","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1016\/j.ic.2005.05.011","volume":"204","author":"M Bozzano","year":"2006","unstructured":"Bozzano, M., et al.: Efficient Theory Combination via Boolean Search. Inf. Comput. 204(10), 1493\u20131525 (2006). https:\/\/doi.org\/10.1016\/j.ic.2005.05.011","journal-title":"Inf. Comput."},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-642-36742-7_7","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A Cimatti","year":"2013","unstructured":"Cimatti, A., Griggio, A., Schaafsma, B.J., Sebastiani, R.: The MathSAT5 SMT solver. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013. LNCS, vol. 7795, pp. 93\u2013107. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36742-7_7"},{"issue":"1","key":"7_CR10","doi-asserted-by":"publisher","first-page":"3518","DOI":"10.1038\/s41598-024-53708-7","volume":"14","author":"J Ding","year":"2024","unstructured":"Ding, J., Spallitta, G., Sebastiani, R.: Effective prime factorization via quantum annealing by modular locally-structured embedding. Sci. Rep. 14(1), 3518 (2024). https:\/\/doi.org\/10.1038\/s41598-024-53708-7","journal-title":"Sci. Rep."},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/11817963_11","volume-title":"Computer Aided Verification","author":"B Dutertre","year":"2006","unstructured":"Dutertre, B., de Moura, L.: A fast linear-arithmetic solver for DPLL(T). In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 81\u201394. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11817963_11"},{"key":"7_CR12","doi-asserted-by":"publisher","unstructured":"Fried, D., Nadel, A., Sebastiani, R., Shalmon, Y.: Entailing generalization boosts enumeration. In: SAT 2024. LIPIcs, vol.\u00a0305, pp. 13:1\u201313:14. LZI (2024). https:\/\/doi.org\/10.4230\/LIPIcs.SAT.2024.13","DOI":"10.4230\/LIPIcs.SAT.2024.13"},{"key":"7_CR13","doi-asserted-by":"publisher","unstructured":"Fried, D., Nadel, A., Shalmon, Y.: AllSAT for combinational circuits. In: SAT 2023. LIPIcs, vol.\u00a0271, pp. 9:1\u20139:18. LZI (2023). https:\/\/doi.org\/10.4230\/LIPIcs.SAT.2023.9","DOI":"10.4230\/LIPIcs.SAT.2023.9"},{"key":"7_CR14","doi-asserted-by":"publisher","unstructured":"Henry, J., Asavoae, M., Monniaux, D., Ma\u00efza, C.: How to compute worst-case execution time by optimization modulo theory and a clever encoding of program semantics. In: LCTES 2014, pp. 43\u201352. ACM (2014). https:\/\/doi.org\/10.1145\/2597809.2597817","DOI":"10.1145\/2597809.2597817"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/11817963_39","volume-title":"Computer Aided Verification","author":"SK Lahiri","year":"2006","unstructured":"Lahiri, S.K., Nieuwenhuis, R., Oliveras, A.: SMT techniques for fast predicate abstraction. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 424\u2013437. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11817963_39"},{"key":"7_CR16","doi-asserted-by":"publisher","unstructured":"Leofante, F., Giunchiglia, E., \u00c1brah\u00e1m, E., Tacchella, A.: Optimal planning modulo theories. In: IJCAI 2020, vol.\u00a04, pp. 4128\u20134134 (2020). https:\/\/doi.org\/10.24963\/ijcai.2020\/571","DOI":"10.24963\/ijcai.2020\/571"},{"key":"7_CR17","doi-asserted-by":"publisher","unstructured":"Li, Y., Albarghouthi, A., Kincaid, Z., Gurfinkel, A., Chechik, M.: Symbolic optimization with SMT solvers. In: POPL 2014, pp. 607\u2013618. ACM (2014). https:\/\/doi.org\/10.1145\/2535838.2535857","DOI":"10.1145\/2535838.2535857"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-642-29700-7_23","volume-title":"Frontiers in Algorithmics and Algorithmic Aspects in Information and Management","author":"F Ma","year":"2012","unstructured":"Ma, F., Yan, J., Zhang, J.: Solving generalized optimization problems subject to SMT constraints. In: Snoeyink, J., Lu, P., Su, K., Wang, L. (eds.) AAIM\/FAW -2012. LNCS, vol. 7285, pp. 247\u2013258. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29700-7_23"},{"key":"7_CR19","doi-asserted-by":"publisher","unstructured":"Marques-Silva, J., Lynce, I., Malik, S.: Conflict-driven clause learning SAT solvers. In: Handbook of Satisfiability, FAIA, vol.\u00a0336. IOS Press (2021). https:\/\/doi.org\/10.3233\/FAIA200987","DOI":"10.3233\/FAIA200987"},{"key":"7_CR20","doi-asserted-by":"publisher","unstructured":"Masina, G., Spallitta, G., Sebastiani, R.: On CNF conversion for disjoint SAT enumeration. In: SAT 2023. LIPIcs, vol.\u00a0271, pp. 15:1\u201315:16. LZI (2023). https:\/\/doi.org\/10.4230\/LIPIcs.SAT.2023.15","DOI":"10.4230\/LIPIcs.SAT.2023.15"},{"key":"7_CR21","doi-asserted-by":"publisher","unstructured":"Masina, G., Spallitta, G., Sebastiani, R.: On CNF conversion for SAT and SMT enumeration. J. Artif. Intell. Res. 83 (2025). https:\/\/doi.org\/10.1613\/jair.1.16870, to appear, preprint arXiv:2303.14971","DOI":"10.1613\/jair.1.16870"},{"key":"7_CR22","doi-asserted-by":"publisher","unstructured":"Morgado, A., Marques-Silva, J.: Good learning and implicit model enumeration. In: ICTAI 2005, pp. 131\u2013136. IEEE Computer Society (2005). https:\/\/doi.org\/10.1109\/ICTAI.2005.69","DOI":"10.1109\/ICTAI.2005.69"},{"key":"7_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1007\/978-3-662-49674-9_53","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A Nadel","year":"2016","unstructured":"Nadel, A., Ryvchin, V.: Bit-vector optimization. In: Chechik, M., Raskin, J.-F. (eds.) TACAS 2016. LNCS, vol. 9636, pp. 851\u2013867. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49674-9_53"},{"issue":"2","key":"7_CR24","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s00766-016-0263-5","volume":"23","author":"CM Nguyen","year":"2016","unstructured":"Nguyen, C.M., Sebastiani, R., Giorgini, P., Mylopoulos, J.: Multi-objective reasoning with constrained goal models. Requirements Eng. 23(2), 189\u2013225 (2016). https:\/\/doi.org\/10.1007\/s00766-016-0263-5","journal-title":"Requirements Eng."},{"key":"7_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/11814948_18","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"R Nieuwenhuis","year":"2006","unstructured":"Nieuwenhuis, R., Oliveras, A.: On SAT modulo theories and optimization problems. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 156\u2013169. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11814948_18"},{"key":"7_CR26","doi-asserted-by":"publisher","unstructured":"Panjkovic, S., Micheli, A.: Expressive optimal temporal planning via optimization modulo theory. In: AAAI 2023, vol. 37, no. 10, pp. 12095\u201312102 (2023). https:\/\/doi.org\/10.1609\/aaai.v37i10.26426","DOI":"10.1609\/aaai.v37i10.26426"},{"key":"7_CR27","doi-asserted-by":"publisher","unstructured":"Panjkovic, S., Micheli, A.: Abstract action scheduling for optimal temporal planning via OMT. In: AAAI 2024, vol. 38, no. 18, pp. 20222\u201320229 (2024). https:\/\/doi.org\/10.1609\/aaai.v38i18.30002","DOI":"10.1609\/aaai.v38i18.30002"},{"issue":"3","key":"7_CR28","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/S0747-7171(86)80028-1","volume":"2","author":"DA Plaisted","year":"1986","unstructured":"Plaisted, D.A., Greenbaum, S.: A Structure-preserving clause form translation. J. Symb. Comput. 2(3), 293\u2013304 (1986). https:\/\/doi.org\/10.1016\/S0747-7171(86)80028-1","journal-title":"J. Symb. Comput."},{"key":"7_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-24730-2_3","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K Ravi","year":"2004","unstructured":"Ravi, K., Somenzi, F.: Minimal assignments for bounded model checking. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 31\u201345. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24730-2_3"},{"issue":"3\u20134","key":"7_CR30","doi-asserted-by":"publisher","first-page":"141","DOI":"10.3233\/SAT190034","volume":"3","author":"R Sebastiani","year":"2007","unstructured":"Sebastiani, R.: Lazy satisfiability modulo theories. JSAT 3(3\u20134), 141\u2013224 (2007). https:\/\/doi.org\/10.3233\/SAT190034","journal-title":"JSAT"},{"key":"7_CR31","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/978-3-642-31365-3_38","volume-title":"Automated Reasoning","author":"R Sebastiani","year":"2012","unstructured":"Sebastiani, R., Tomasi, S.: Optimization in SMT with LA(Q) cost functions. In: Gramlich, B., Miller, D., Sattler, U. (eds.) IJCAR 2012. LNCS (LNAI), vol. 7364, pp. 484\u2013498. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31365-3_38"},{"key":"7_CR32","doi-asserted-by":"publisher","unstructured":"Sebastiani, R., Tomasi, S.: Optimization modulo theories with linear rational costs. ACM Trans. Comput. Logic 16(2), 12:1\u201312:43 (2015). https:\/\/doi.org\/10.1145\/2699915","DOI":"10.1145\/2699915"},{"key":"7_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-662-46681-0_27","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R Sebastiani","year":"2015","unstructured":"Sebastiani, R., Trentin, P.: Pushing the envelope of optimization modulo theories with linear-arithmetic cost functions. In: Baier, C., Tinelli, C. (eds.) TACAS 2015. LNCS, vol. 9035, pp. 335\u2013349. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46681-0_27"},{"issue":"3","key":"7_CR34","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10817-018-09508-6","volume":"64","author":"R Sebastiani","year":"2018","unstructured":"Sebastiani, R., Trentin, P.: OptiMathSAT: a tool for optimization modulo theories. J. Autom. Reason. 64(3), 423\u2013460 (2018). https:\/\/doi.org\/10.1007\/s10817-018-09508-6","journal-title":"J. Autom. Reason."},{"key":"7_CR35","doi-asserted-by":"publisher","unstructured":"Spallitta, G., Sebastiani, R., Biere, A.: Disjoint partial enumeration without blocking clauses. In: AAAI 2024, vol.\u00a038, pp. 8126\u20138135 (2024). https:\/\/doi.org\/10.1609\/aaai.v38i8.28652","DOI":"10.1609\/aaai.v38i8.28652"},{"key":"7_CR36","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2025.104346","volume":"345","author":"G Spallitta","year":"2025","unstructured":"Spallitta, G., Sebastiani, R., Biere, A.: Disjoint projected enumeration for SAT and SMT without blocking clauses. Artif. Intell. 345, 104346 (2025). https:\/\/doi.org\/10.1016\/j.artint.2025.104346","journal-title":"Artif. Intell."},{"key":"7_CR37","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.artint.2015.04.002","volume":"244","author":"S Teso","year":"2017","unstructured":"Teso, S., Sebastiani, R., Passerini, A.: Structured learning modulo theories. Artif. Intell. 244, 166\u2013187 (2017). https:\/\/doi.org\/10.1016\/j.artint.2015.04.002","journal-title":"Artif. Intell."},{"key":"7_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2975585","volume":"21","author":"T Toda","year":"2016","unstructured":"Toda, T., Soh, T.: Implementing efficient all solutions SAT solvers. ACM J. Exp. Algorithmics 21, 1\u201344 (2016). https:\/\/doi.org\/10.1145\/2975585","journal-title":"ACM J. Exp. Algorithmics"},{"issue":"7","key":"7_CR39","doi-asserted-by":"publisher","first-page":"1071","DOI":"10.1007\/s10817-021-09600-4","volume":"65","author":"P Trentin","year":"2021","unstructured":"Trentin, P., Sebastiani, R.: Optimization modulo the theories of signed bit-vectors and floating-point numbers. J. Autom. Reason. 65(7), 1071\u20131096 (2021). https:\/\/doi.org\/10.1007\/s10817-021-09600-4","journal-title":"J. Autom. Reason."},{"key":"7_CR40","series-title":"Symbolic Computation","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/978-3-642-81955-1_28","volume-title":"Automation of Reasoning","author":"GS Tseitin","year":"1983","unstructured":"Tseitin, G.S.: On the complexity of derivation in propositional calculus. In: Siekmann, J.H., Wrightson, G. (eds.) Automation of Reasoning. Symbolic Computation, pp. 466\u2013483. Springer, Heidelberg (1983). https:\/\/doi.org\/10.1007\/978-3-642-81955-1_28"},{"key":"7_CR41","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/978-3-031-63498-7_27","volume-title":"IJCAR 2024","author":"N Tsiskaridze","year":"2024","unstructured":"Tsiskaridze, N., Barrett, C., Tinelli, C.: Generalized optimization modulo theories. In: Benzm\u00fcller, C., Heule, M.J., Schmidt, R.A. (eds.) IJCAR 2024. LNCS, vol. 14739, pp. 458\u2013479. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-63498-7_27"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Combining Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-04167-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,14]],"date-time":"2025-09-14T22:03:58Z","timestamp":1757887438000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-04167-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,15]]},"ISBN":["9783032041661","9783032041678"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-04167-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,15]]},"assertion":[{"value":"15 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FroCoS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Frontiers of Combining Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Reykjavik","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Iceland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 October 2025","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":"frocos2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icetcs.github.io\/frocos-itp-tableaux25\/frocos\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}