{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T20:13:56Z","timestamp":1758053636531,"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>Considering patterns as sets of their instances, a difference operator over patterns computes a finite set of two given patterns, which represents the difference between the dividend pattern and the divisor pattern. A complement of a pattern is a pattern set, the ground constructor instances of which comprise the complement of the ground constructor instances of the former pattern. Given finitely many unconstrained linear patterns, using a difference operator over linear patterns, a complement algorithm returns a finite set of linear patterns as a complement of the given patterns. In this paper, we extend the difference operator and complement algorithm to constrained linear patterns used in logically constrained term rewrite systems (LCTRSs, for short) that have no user-defined constructor term with a sort for built-in values. Then, as for left-linear term rewrite systems, using the complement algorithm, we show that quasi-reducibility is decidable for such LCTRSs with decidable built-in theories. For the single use of the difference operator over constrained patterns, only divisor patterns are required to be linear.<\/jats:p>","DOI":"10.1007\/978-3-032-04167-8_14","type":"book-chapter","created":{"date-parts":[[2025,9,14]],"date-time":"2025-09-14T22:03:21Z","timestamp":1757887401000},"page":"247-266","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Difference of\u00a0Constrained Patterns in\u00a0Logically Constrained Term Rewrite Systems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8697-4970","authenticated-orcid":false,"given":"Naoki","family":"Nishida","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5194-3947","authenticated-orcid":false,"given":"Misaki","family":"Kojima","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuto","family":"Nakamura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,9,15]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","unstructured":"Aoto, T., Nishida, N., Sch\u00f6pf, J.: Equational theories and validity for logically constrained term rewriting. In: Rehof, J. (ed.) Proceedings of the 9th International Conference on Formal Structures for Computation and Deduction. Leibniz International Proceedings in Informatics, vol.\u00a0299, pp. 31:1\u201331:21. Schloss Dagstuhl\u00a0\u2013\u00a0Leibniz-Zentrum f\u00fcr Informatik (2024). https:\/\/doi.org\/10.4230\/LIPICS.FSCD.2024.31","DOI":"10.4230\/LIPICS.FSCD.2024.31"},{"key":"14_CR2","doi-asserted-by":"publisher","unstructured":"Aoto, T., Toyama, Y., Kimura, Y.: Improving rewriting induction approach for proving ground confluence. In: Miller, D. (ed.) Proceedings of the 2nd International Conference on Formal Structures for Computation and Deduction. LIPIcs, vol.\u00a084, pp. 7:1\u20137:18. Schloss Dagstuhl\u00a0\u2013\u00a0Leibniz-Zentrum f\u00fcr Informatik (2017). https:\/\/doi.org\/10.4230\/LIPICS.FSCD.2017.7","DOI":"10.4230\/LIPICS.FSCD.2017.7"},{"key":"14_CR3","doi-asserted-by":"publisher","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press (1998). https:\/\/doi.org\/10.1145\/505863.505888","DOI":"10.1145\/505863.505888"},{"key":"14_CR4","unstructured":"Barrett, C., Fontaine, P., Tinelli, C.: The Satisfiability Modulo Theories Library (SMT-LIB) (2016). https:\/\/www.SMT-LIB.org"},{"key":"14_CR5","doi-asserted-by":"publisher","unstructured":"Barrett, C.W., Sebastiani, R., Seshia, S.A., Tinelli, C.: Satisfiability modulo theories. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, vol.\u00a0336, pp. 1267\u20131329, 2nd edn. IOS Press (2021). https:\/\/doi.org\/10.3233\/FAIA201017","DOI":"10.3233\/FAIA201017"},{"issue":"1","key":"14_CR6","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/J.JAL.2011.09.001","volume":"10","author":"A Bouhoula","year":"2012","unstructured":"Bouhoula, A., Jacquemard, F.: Sufficient completeness verification for conditional and constrained TRS. J. Appl. Log. 10(1), 127\u2013143 (2012). https:\/\/doi.org\/10.1016\/J.JAL.2011.09.001","journal-title":"J. Appl. Log."},{"key":"14_CR7","doi-asserted-by":"publisher","unstructured":"Chen, X., Ro\u015fu, G.: Matching $$\\mu $$-logic. In: Proceedings of the 34th Annual ACM\/IEEE Symposium on Logic in Computer Science, pp. 1\u201313. IEEE (2019). https:\/\/doi.org\/10.1109\/LICS.2019.8785675","DOI":"10.1109\/LICS.2019.8785675"},{"key":"14_CR8","doi-asserted-by":"publisher","unstructured":"Chen, X., Ro\u015fu, G.: Matching mu-logic: foundation of K framework (invited paper). In: Roggenbach, M., Sokolova, A. (eds.) Proceedings of the 8th Conference on Algebra and Coalgebra in Computer Science. LIPIcs, vol.\u00a0139, pp. 1:1\u20131:4. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPICS.CALCO.2019.1","DOI":"10.4230\/LIPICS.CALCO.2019.1"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-662-57669-4_10","volume-title":"Logic, Language, Information, and Computation","author":"\u015e Ciob\u00e2c\u0103","year":"2018","unstructured":"Ciob\u00e2c\u0103, \u015e, Arusoaie, A., Lucanu, D.: Unification modulo builtins. In: Moss, L.S., de Queiroz, R., Martinez, M. (eds.) WoLLIC 2018. LNCS, vol. 10944, pp. 179\u2013195. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-662-57669-4_10"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-319-94205-6_20","volume-title":"Automated Reasoning","author":"\u015e Ciob\u00e2c\u0103","year":"2018","unstructured":"Ciob\u00e2c\u0103, \u015e, Lucanu, D.: A coinductive approach to proving reachability properties in logically constrained term rewriting systems. In: Galmiche, D., Schulz, S., Sebastiani, R. (eds.) IJCAR 2018. LNCS (LNAI), vol. 10900, pp. 295\u2013311. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94205-6_20"},{"key":"14_CR11","unstructured":"Comon, H., et al.: Tree automata techniques and applications (2007). http:\/\/www.grappa.univ-lille3.fr\/tata"},{"issue":"1","key":"14_CR12","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1006\/JSCO.1998.0203","volume":"26","author":"M Fern\u00e1ndez","year":"1998","unstructured":"Fern\u00e1ndez, M.: Negation elimination in empty or permutative theories. J. Symb. Comput. 26(1), 97\u2013133 (1998). https:\/\/doi.org\/10.1006\/JSCO.1998.0203","journal-title":"J. Symb. Comput."},{"key":"14_CR13","doi-asserted-by":"publisher","unstructured":"Fuhs, C., Guo, L., Kop, C.: An innermost DP framework for constrained higher-order rewriting. In: Fern\u00e1ndez, M. (ed.) Proceedings of the 10th International Conference on Formal Structures for Computation and Deduction. LIPIcs, vol.\u00a0337, pp. 20:1\u201320:24. Schloss Dagstuhl\u00a0\u2013\u00a0Leibniz-Zentrum f\u00fcr Informatik (2025). https:\/\/doi.org\/10.4230\/LIPIcs.FSCD.2025.20","DOI":"10.4230\/LIPIcs.FSCD.2025.20"},{"key":"14_CR14","doi-asserted-by":"publisher","unstructured":"Fuhs, C., Kop, C., Nishida, N.: Verifying procedural programs via constrained rewriting induction. ACM Trans. Comput. Logic 18(2), 14:1\u201314:50 (2017). https:\/\/doi.org\/10.1145\/3060143","DOI":"10.1145\/3060143"},{"key":"14_CR15","unstructured":"Higashiwada, N., Aoto, T.: Automatically proving sufficient completeness of conditional term rewriting systems. In: Manuscript for the presentation at the 124th Workshop of IPSJ Special Interest Group on Programming, pp.\u00a01\u20136 (2019). (in Japanese)"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Kanazawa, Y., Nishida, N.: On transforming functions accessing global variables into logically constrained term rewriting systems. In: Niehren, J., Sabel, D. (eds.) Proceedings of the 5th International Workshop on Rewriting Techniques for Program Transformations and Evaluation. Electronic Proceedings in Theoretical Computer Science, vol.\u00a0289, pp. 34\u201352. Open Publishing Association (2019)","DOI":"10.4204\/EPTCS.289.3"},{"key":"14_CR17","unstructured":"Kanazawa, Y., Nishida, N., Sakai, M.: On representation of structures and unions in logically constrained rewriting. In: IEICE Technical Report SS2018-38, the Institute of Electronics, Information and Communication Engineers, vol. 118, no. 385, pp. 67\u201372 (2019). (in Japanese)"},{"issue":"4","key":"14_CR18","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/BF00292110","volume":"24","author":"D Kapur","year":"1987","unstructured":"Kapur, D., Narendran, P., Zhang, H.: On sufficient-completeness and related properties of term rewriting systems. Acta Informatica 24(4), 395\u2013415 (1987). https:\/\/doi.org\/10.1007\/BF00292110","journal-title":"Acta Informatica"},{"key":"14_CR19","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-031-24841-2_11","volume-title":"Practical Aspects of Declarative Languages Lecture Notes in Computer Science","author":"M Kojima","year":"2023","unstructured":"Kojima, M., Nishida, N.: From starvation freedom to all-path reachability problems in constrained rewriting. In: Hanus, M., Inclezan, D. (eds.) PADL 2023. LNCS, vol. 13880, pp. 161\u2013179. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-24841-2_11"},{"key":"14_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jlamp.2023.100903","volume":"135","author":"M Kojima","year":"2023","unstructured":"Kojima, M., Nishida, N.: Reducing non-occurrence of specified runtime errors to all-path reachability problems of constrained rewriting. J. Logical Algebraic Methods Program. 135, 1\u201319 (2023). https:\/\/doi.org\/10.1016\/j.jlamp.2023.100903","journal-title":"J. Logical Algebraic Methods Program."},{"key":"14_CR21","first-page":"417","volume":"32","author":"M Kojima","year":"2024","unstructured":"Kojima, M., Nishida, N.: A sufficient condition of logically constrained term rewrite systems for decidability of all-path reachability problems with constant destinations. J. Inf. Process. 32, 417\u2013435 (2024)","journal-title":"J. Inf. Process."},{"key":"14_CR22","unstructured":"Kojima, M., Nishida, N., Matsubara, Y.: Transforming concurrent programs with semaphores into logically constrained term rewrite systems. In: Riesco, A., Nigam, V. (eds.) Informal Proceedings of the 7th International Workshop on Rewriting Techniques for Program Transformations and Evaluation, pp. 1\u201312 (2020)"},{"key":"14_CR23","doi-asserted-by":"publisher","unstructured":"Kojima, M., Nishida, N., Matsubara, Y.: Transforming concurrent programs with semaphores into logically constrained term rewrite systems. J. Logical Algebraic Methods Program. 143, 1\u201323 (2025). https:\/\/doi.org\/10.1016\/j.jlamp.2024.101033","DOI":"10.1016\/j.jlamp.2024.101033"},{"key":"14_CR24","unstructured":"Kop, C.: Quasi-reductivity of logically constrained term rewriting systems. CoRR abs\/1702.02397 (2017). http:\/\/arxiv.org\/abs\/1702.02397"},{"key":"14_CR25","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-642-40885-4_24","volume-title":"Frontiers of Combining Systems","author":"C Kop","year":"2013","unstructured":"Kop, C., Nishida, N.: Term rewriting with logical constraints. In: Fontaine, P., Ringeissen, C., Schmidt, R.A. (eds.) FroCoS 2013. LNCS (LNAI), vol. 8152, pp. 343\u2013358. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40885-4_24"},{"key":"14_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/978-3-662-48899-7_38","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"C Kop","year":"2015","unstructured":"Kop, C., Nishida, N.: Constrained term rewriting tool. In: Davis, M., Fehnker, A., McIver, A., Voronkov, A. (eds.) LPAR 2015. LNCS, vol. 9450, pp. 549\u2013557. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48899-7_38"},{"key":"14_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/3-540-17179-7_6","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"J-L Lassez","year":"1986","unstructured":"Lassez, J.-L., Marriott, K.: Explicit representation of terms defined by counter examples. In: Nori, K.V. (ed.) FSTTCS 1986. LNCS, vol. 241, pp. 96\u2013107. Springer, Heidelberg (1986). https:\/\/doi.org\/10.1007\/3-540-17179-7_6"},{"issue":"1","key":"14_CR28","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0890-5401(90)90033-E","volume":"84","author":"A Lazrek","year":"1990","unstructured":"Lazrek, A., Lescanne, P., Thiel, J.J.: Tools for proving inductive equalities, relative completeness, and $$\\omega $$-completeness. Inf. Comput. 84(1), 47\u201370 (1990). https:\/\/doi.org\/10.1016\/0890-5401(90)90033-E","journal-title":"Inf. Comput."},{"issue":"3","key":"14_CR29","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1017\/s0956796807006223","volume":"17","author":"L Maranget","year":"2007","unstructured":"Maranget, L.: Warnings for pattern matching. J. Funct. Program. 17(3), 387\u2013421 (2007). https:\/\/doi.org\/10.1017\/s0956796807006223","journal-title":"J. Funct. Program."},{"key":"14_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jlamp.2025.101045","volume":"144","author":"N Nishida","year":"2025","unstructured":"Nishida, N., Kojima, M., Matsumi, A.: A nesting-preserving transformation of SIMP programs into logically constrained term rewrite systems. J. Logical Algebraic Methods Program. 144, 1\u201315 (2025). https:\/\/doi.org\/10.1016\/j.jlamp.2025.101045","journal-title":"J. Logical Algebraic Methods Program."},{"key":"14_CR31","doi-asserted-by":"publisher","unstructured":"Nishida, N., Kojima, M., Nakamura, Y.: Difference of constrained patterns in logically constrained term rewrite systems (full version). CoRR abs\/2505.04080 (2025). https:\/\/doi.org\/10.48550\/arXiv.2507.04080","DOI":"10.48550\/arXiv.2507.04080"},{"key":"14_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-030-03592-1_18","volume-title":"Verified Software. Theories, Tools, and Experiments","author":"N Nishida","year":"2018","unstructured":"Nishida, N., Winkler, S.: Loop detection by logically constrained term rewriting. In: Piskac, R., R\u00fcmmer, P. (eds.) VSTTE 2018. LNCS, vol. 11294, pp. 309\u2013321. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03592-1_18"},{"key":"14_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3661-8","volume-title":"Advanced Topics in Term Rewriting","author":"E Ohlebusch","year":"2002","unstructured":"Ohlebusch, E.: Advanced Topics in Term Rewriting. Springer, Cham (2002). https:\/\/doi.org\/10.1007\/978-1-4757-3661-8"},{"key":"14_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/3-540-52885-7_86","volume-title":"10th International Conference on Automated Deduction","author":"US Reddy","year":"1990","unstructured":"Reddy, U.S.: Term rewriting induction. In: Stickel, M.E. (ed.) CADE 1990. LNCS, vol. 449, pp. 162\u2013177. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-52885-7_86"},{"key":"14_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-89960-2_1","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G Reger","year":"2018","unstructured":"Reger, G., Suda, M., Voronkov, A.: Unification with abstraction and theory instantiation in saturation-based reasoning. In: Beyer, D., Huisman, M. (eds.) TACAS 2018. LNCS, vol. 10805, pp. 3\u201322. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89960-2_1"},{"key":"14_CR36","doi-asserted-by":"publisher","unstructured":"Rosu, G.: Matching logic. Logical Methods Comput. Sci. 13(4) (2017). https:\/\/doi.org\/10.23638\/LMCS-13(4:28)2017","DOI":"10.23638\/LMCS-13(4:28)2017"},{"key":"14_CR37","unstructured":"Sakata, T., Nishida, N., Sakabe, T., Sakai, M., Kusakari, K.: Rewriting induction for constrained term rewriting systems. IPSJ Trans. Program. 2(2), 80\u201396 (2009). (in Japanese) (a translated summary is available from https:\/\/www.trs.css.i.nagoya-u.ac.jp\/crisys\/)"},{"key":"14_CR38","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-031-63501-4_16","volume-title":"Automated Reasoning","author":"J Sch\u00f6pf","year":"2024","unstructured":"Sch\u00f6pf, J., Mitterwallner, F., Middeldorp, A.: Confluence of logically constrained rewrite systems revisited. In: Benzm\u00fcller, C., Heule, M.J.H., Schmidt, R.A. (eds.) Automated Reasoning. LNCS, vol. 14740, pp. 298\u2013316. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-63501-4_16"},{"key":"14_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/978-3-662-21551-7_24","volume-title":"Rewriting Techniques and Applications","author":"M Tajine","year":"1993","unstructured":"Tajine, M.: The negation elimination from syntactic equational formula is decidable. In: Kirchner, C. (ed.) RTA 1993. LNCS, vol. 690, pp. 316\u2013327. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/978-3-662-21551-7_24"},{"key":"14_CR40","doi-asserted-by":"publisher","unstructured":"Thiemann, R., Yamada, A.: A verified algorithm for deciding pattern completeness. In: Rehof, J. (ed.) Proceedings of the 9th International Conference on Formal Structures for Computation and Deduction. LIPIcs, vol.\u00a0299, pp. 27:1\u201327:17. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2024). https:\/\/doi.org\/10.4230\/LIPICS.FSCD.2024.27","DOI":"10.4230\/LIPICS.FSCD.2024.27"},{"key":"14_CR41","doi-asserted-by":"publisher","unstructured":"Winkler, S., Middeldorp, A.: Completion for logically constrained rewriting. In: Kirchner, H. (ed.) Proceedings of the 3rd International Conference on Formal Structures for Computation and Deduction. Leibniz International Proceedings in Informatics, vol.\u00a0108, pp. 30:1\u201330:18. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.FSCD.2018.30","DOI":"10.4230\/LIPIcs.FSCD.2018.30"}],"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_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,14]],"date-time":"2025-09-14T22:03:24Z","timestamp":1757887404000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-04167-8_14"}},"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_14","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"}}]}}