{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T23:10:00Z","timestamp":1765667400434,"version":"3.40.3"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031124402"},{"type":"electronic","value":"9783031124419"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-12441-9_10","type":"book-chapter","created":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T10:23:34Z","timestamp":1659090214000},"page":"191-211","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On Ground Convergence and\u00a0Completeness of\u00a0Conditional Equational Program Hierarchies"],"prefix":"10.1007","author":[{"given":"Jos\u00e9","family":"Meseguer","sequence":"first","affiliation":[]},{"given":"Stephen","family":"Skeirik","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,30]]},"reference":[{"key":"10_CR1","unstructured":"Aoto, T., Toyama, Y.: Ground confluence prover based on rewriting induction. In: 1st International Conference on Formal Structures for Computation and Deduction, FSCD 2016. LIPIcs, vol. 52, pp. 33:1\u201333:12. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016)"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-642-02348-4_7","volume-title":"Rewriting Techniques and Applications","author":"T Aoto","year":"2009","unstructured":"Aoto, T., Yoshida, J., Toyama, Y.: Proving confluence of term rewriting systems automatically. In: Treinen, R. (ed.) RTA 2009. LNCS, vol. 5595, pp. 93\u2013102. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02348-4_7"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/3-540-56610-4_55","volume-title":"TAPSOFT\u201993: Theory and Practice of Software Development","author":"K Becker","year":"1993","unstructured":"Becker, K.: Proving ground confluence and inductive validity in constructor based equational specifications. In: Gaudel, M.-C., Jouannaud, J.-P. (eds.) CAAP 1993. LNCS, vol. 668, pp. 46\u201360. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-56610-4_55"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Bouhoula, A.: Simultaneous checking of completeness and ground confluence for algebraic specifications. ACM Trans. Comput. Log. 10(3), 20:1\u201320:33 (2009)","DOI":"10.1145\/1507244.1507250"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Bouhoula, A., Jouannaud, J.P.: Automata-driven automated induction. Inf. Comput. 169(1), 1\u201322 (2001)","DOI":"10.1006\/inco.2001.3036"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Bouhoula, A., Rusinowitch, M.: Implicit induction in conditional theories. J. Autom. Reason. 14(2), 189\u2013235 (1995). https:\/\/doi.org\/10.1007\/BF00881856","DOI":"10.1007\/BF00881856"},{"key":"10_CR7","doi-asserted-by":"publisher","unstructured":"Clavel, M., et al.: All About Maude - A High-Performance Logical Framework. LNCS, vol. 4350. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71999-1","DOI":"10.1007\/978-3-540-71999-1"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/3-540-16780-3_85","volume-title":"8th International Conference on Automated Deduction","author":"H Comon","year":"1986","unstructured":"Comon, H.: Sufficient completeness, term rewriting systems and \u201canti-unification\u2019\u2019. In: Siekmann, J.H. (ed.) CADE 1986. LNCS, vol. 230, pp. 128\u2013140. Springer, Heidelberg (1986). https:\/\/doi.org\/10.1007\/3-540-16780-3_85"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Dershowitz, N., Jouannaud, J.P.: Rewrite systems. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, pp. 243\u2013320. North-Holland (1990)","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-642-04222-5_15","volume-title":"Frontiers of Combining Systems","author":"F Dur\u00e1n","year":"2009","unstructured":"Dur\u00e1n, F., Lucas, S., Meseguer, J.: Termination modulo combinations of equational theories. In: Ghilardi, S., Sebastiani, R. (eds.) FroCoS 2009. LNCS (LNAI), vol. 5749, pp. 246\u2013262. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04222-5_15"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"816","DOI":"10.1016\/j.jlap.2011.12.004","volume":"81","author":"F Dur\u00e1n","year":"2012","unstructured":"Dur\u00e1n, F., Meseguer, J.: On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories. J. Algebraic Log. Program. 81, 816\u2013850 (2012)","journal-title":"J. Algebraic Log. Program."},{"key":"10_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlamp.2019.100513","volume":"111","author":"F Dur\u00e1n","year":"2020","unstructured":"Dur\u00e1n, F., Meseguer, J., Rocha, C.: Ground confluence of order-sorted conditional specifications modulo axioms. J. Log. Algebraic Methods Program. 111, 100513 (2020)","journal-title":"J. Log. Algebraic Methods Program."},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"898","DOI":"10.1016\/j.jlap.2012.01.002","volume":"81","author":"S Escobar","year":"2012","unstructured":"Escobar, S., Sasse, R., Meseguer, J.: Folding variant narrowing and optimal variant termination. J. Algebraic Log. Program. 81, 898\u2013928 (2012)","journal-title":"J. Algebraic Log. Program."},{"issue":"3","key":"10_CR14","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0747-7171(89)80069-0","volume":"8","author":"L Fribourg","year":"1989","unstructured":"Fribourg, L.: A strong restriction of the inductive completion procedure. J. Symb. Comput. 8(3), 253\u2013276 (1989)","journal-title":"J. Symb. Comput."},{"key":"10_CR15","volume-title":"CafeOBJ Report","author":"K Futatsugi","year":"1998","unstructured":"Futatsugi, K., Diaconescu, R.: CafeOBJ Report. World Scientific, Singapore (1998)"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/BFb0039613","volume-title":"STACS 87","author":"H Ganzinger","year":"1987","unstructured":"Ganzinger, H.: Ground term confluence in parametric conditional equational specifications. In: Brandenburg, F.J., Vidal-Naquet, G., Wirsing, M. (eds.) STACS 1987. LNCS, vol. 247, pp. 286\u2013298. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/BFb0039613"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/3-540-17220-3_14","volume-title":"Rewriting Techniques and Applications","author":"R G\u00f6bel","year":"1987","unstructured":"G\u00f6bel, R.: Ground confluence. In: Lescanne, P. (ed.) RTA 1987. LNCS, vol. 256, pp. 156\u2013167. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-17220-3_14"},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0304-3975(92)90302-V","volume":"105","author":"J Goguen","year":"1992","unstructured":"Goguen, J., Meseguer, J.: Order-sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operations. Theoret. Comput. Sci. 105, 217\u2013273 (1992)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Goguen, J., Winkler, T., Meseguer, J., Futatsugi, K., Jouannaud, J.P.: Introducing OBJ. In: Software Engineering with OBJ: Algebraic Specification in Action, pp. 3\u2013167. Kluwer (2000)","DOI":"10.1007\/978-1-4757-6541-0_1"},{"key":"10_CR20","unstructured":"Guti\u00e9rrez, R., Meseguer, J., Skeirik, S.: The Maude termination assistant. In: Pre-proceedings of WRLA (2018)"},{"key":"10_CR21","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/j.scico.2014.07.003","volume":"99","author":"R Guti\u00e9rrez","year":"2015","unstructured":"Guti\u00e9rrez, R., Meseguer, J., Rocha, C.: Order-sorted equality enrichments modulo axioms. Sci. Comput. Program. 99, 235\u2013261 (2015)","journal-title":"Sci. Comput. Program."},{"key":"10_CR22","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/BF00260922","volume":"10","author":"JV Guttag","year":"1978","unstructured":"Guttag, J.V., Horning, J.J.: The algebraic specification of abstract data types. Acta Inform. 10, 27\u201352 (1978)","journal-title":"Acta Inform."},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-540-32033-3_13","volume-title":"Term Rewriting and Applications","author":"J Hendrix","year":"2005","unstructured":"Hendrix, J., Clavel, M., Meseguer, J.: A sufficient completeness reasoning tool for partial specifications. In: Giesl, J. (ed.) RTA 2005. LNCS, vol. 3467, pp. 165\u2013174. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-32033-3_13"},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-540-73449-9_18","volume-title":"Term Rewriting and Applications","author":"J Hendrix","year":"2007","unstructured":"Hendrix, J., Meseguer, J.: On the completeness of context-sensitive order-sorted specifications. In: Baader, F. (ed.) RTA 2007. LNCS, vol. 4533, pp. 229\u2013245. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73449-9_18"},{"key":"10_CR25","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/11814771_14","volume-title":"Automated Reasoning","author":"J Hendrix","year":"2006","unstructured":"Hendrix, J., Meseguer, J., Ohsaki, H.: A sufficient completeness checker for linear order-sorted specifications modulo axioms. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 151\u2013155. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11814771_14"},{"key":"10_CR26","unstructured":"Hirokawa, N., Klein, D.: Saigawa: a confluence tool. In: Proceedings of 1st International Workshop on Confluence (IWC 2012), p. 57 (2011). http:\/\/cl-informatik.uibk.ac.at\/iwc\/iwc2012.pdf"},{"issue":"1","key":"10_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(89)90062-X","volume":"82","author":"JP Jouannaud","year":"1989","unstructured":"Jouannaud, J.P., Kounalis, E.: Automatic proofs by induction in theories without constructors. Inf. Comput. 82(1), 1\u201333 (1989)","journal-title":"Inf. Comput."},{"issue":"1","key":"10_CR28","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/0890-5401(90)90023-B","volume":"86","author":"D Kapur","year":"1990","unstructured":"Kapur, D., Narendran, P., Otto, F.: On ground-confluence of term rewriting systems. Inf. Comput. 86(1), 14\u201331 (1990)","journal-title":"Inf. Comput."},{"issue":"4","key":"10_CR29","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/BF01212959","volume":"36","author":"D Kapur","year":"1991","unstructured":"Kapur, D., Narendran, P., Rosenkrantz, D.J., Zhang, H.: Sufficient-completeness, ground-reducibility and their complexity. Int. J. Biometeorol. 36(4), 311\u2013350 (1991). https:\/\/doi.org\/10.1007\/BF01212959","journal-title":"Int. J. Biometeorol."},{"key":"10_CR30","unstructured":"Kikuchi, K., Aoto, T.: Simple derivation systems for proving sufficient completeness of non-terminating term rewriting systems. In: 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021. LIPIcs, vol. 213, pp. 49:1\u201349:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"10_CR31","unstructured":"Kirchner, C.: Order-sorted equational unification. Technical report 954. INRIA Lorraine & LORIA, Nancy, France, December 1988"},{"issue":"1","key":"10_CR32","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.jlamp.2015.06.001","volume":"85","author":"S Lucas","year":"2016","unstructured":"Lucas, S., Meseguer, J.: Normal forms and normal theories in conditional rewriting. J. Log. Algebr. Meth. Program. 85(1), 67\u201397 (2016)","journal-title":"J. Log. Algebr. Meth. Program."},{"key":"10_CR33","doi-asserted-by":"crossref","unstructured":"Meseguer, J.: Checking sufficient completeness by inductive theorem proving. In: In: Bae, K. (ed.) WRLA 2022. LNCS, vol. 13252, pp. 171\u2013190. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-12441-9_9"},{"key":"10_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-030-63595-4_7","volume-title":"Rewriting Logic and Its Applications","author":"J Meseguer","year":"2020","unstructured":"Meseguer, J., Skeirik, S.: Inductive reasoning with equality predicates, contextual rewriting and variant-based simplification. In: Escobar, S., Mart\u00ed-Oliet, N. (eds.) WRLA 2020. LNCS, vol. 12328, pp. 114\u2013135. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-63595-4_7"},{"issue":"1","key":"10_CR35","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","volume":"96","author":"J Meseguer","year":"1992","unstructured":"Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. Theoret. Comput. Sci. 96(1), 73\u2013155 (1992)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/3-540-64299-4_26","volume-title":"Recent Trends in Algebraic Development Techniques","author":"J Meseguer","year":"1998","unstructured":"Meseguer, J.: Membership algebra as a logical framework for equational specification. In: Presicce, F.P. (ed.) WADT 1997. LNCS, vol. 1376, pp. 18\u201361. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-64299-4_26"},{"key":"10_CR37","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.scico.2017.09.001","volume":"154","author":"J Meseguer","year":"2018","unstructured":"Meseguer, J.: Variant-based satisfiability in initial algebras. Sci. Comput. Program. 154, 3\u201341 (2018)","journal-title":"Sci. Comput. Program."},{"issue":"3","key":"10_CR38","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s00165-017-0415-5","volume":"29","author":"J Meseguer","year":"2017","unstructured":"Meseguer, J., Skeirik, S.: Equational formulas and pattern operations in initial order-sorted algebras. Formal Aspects Comput. 29(3), 423\u2013452 (2017). https:\/\/doi.org\/10.1007\/s00165-017-0415-5","journal-title":"Formal Aspects Comput."},{"key":"10_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-642-54624-2_5","volume-title":"Specification, Algebra, and Software","author":"M Nakamura","year":"2014","unstructured":"Nakamura, M., Ogata, K., Futatsugi, K.: Incremental proofs of termination, confluence and sufficient completeness of OBJ specifications. In: Iida, S., Meseguer, J., Ogata, K. (eds.) Specification, Algebra, and Software. LNCS, vol. 8373, pp. 92\u2013109. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54624-2_5"},{"issue":"2","key":"10_CR40","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1145\/322248.322251","volume":"28","author":"GE Peterson","year":"1981","unstructured":"Peterson, G.E., Stickel, M.E.: Complete sets of reductions for some equational theories. J. Assoc. Comput. Mach. 28(2), 233\u2013264 (1981)","journal-title":"J. Assoc. Comput. Mach."},{"key":"10_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/3-540-19242-5_16","volume-title":"Conditional Term Rewriting Systems","author":"DA Plaisted","year":"1988","unstructured":"Plaisted, D.A.: A logic for conditional term rewriting systems. In: Kaplan, S., Jouannaud, J.-P. (eds.) CTRS 1987. LNCS, vol. 308, pp. 212\u2013227. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-19242-5_16"},{"key":"10_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-030-85315-0_22","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2021","author":"T Shiraishi","year":"2021","unstructured":"Shiraishi, T., Kikuchi, K., Aoto, T.: A proof method for local sufficient completeness of term rewriting systems. In: Cerone, A., \u00d6lveczky, P.C. (eds.) ICTAC 2021. LNCS, vol. 12819, pp. 386\u2013404. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-85315-0_22"},{"key":"10_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/978-3-319-08918-8_31","volume-title":"Rewriting and Typed Lambda Calculi","author":"T Sternagel","year":"2014","unstructured":"Sternagel, T., Middeldorp, A.: Conditional confluence (system description). In: Dowek, G. (ed.) RTA 2014. LNCS, vol. 8560, pp. 456\u2013465. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08918-8_31"},{"key":"10_CR44","doi-asserted-by":"crossref","unstructured":"Thiel, J.J.: Stop losing sleep over incomplete data type specification. In: Kennedy, K. (ed.) Proceedings of Eleventh Symposium on Principles of Programming Languages. Association for Computing Machinery (1984)","DOI":"10.1145\/800017.800518"},{"key":"10_CR45","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-642-22438-6_38","volume-title":"Automated Deduction \u2013 CADE-23","author":"H Zankl","year":"2011","unstructured":"Zankl, H., Felgenhauer, B., Middeldorp, A.: CSI \u2013 a confluence tool. In: Bj\u00f8rner, N., Sofronie-Stokkermans, V. (eds.) CADE 2011. LNCS (LNAI), vol. 6803, pp. 499\u2013505. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22438-6_38"},{"key":"10_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/3-540-15976-2_2","volume-title":"Rewriting Techniques and Applications","author":"H Zhang","year":"1985","unstructured":"Zhang, H., Remy, J.-L.: Contextual rewriting. In: Jouannaud, J.-P. (ed.) RTA 1985. LNCS, vol. 202, pp. 46\u201362. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/3-540-15976-2_2"}],"container-title":["Lecture Notes in Computer Science","Rewriting Logic and Its Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-12441-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,12]],"date-time":"2023-02-12T23:33:47Z","timestamp":1676244827000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-12441-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031124402","9783031124419"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-12441-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"30 July 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WRLA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Rewriting Logic and its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Munich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 April 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 April 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wrla2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/sv.postech.ac.kr\/wrla2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}