{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T11:00:45Z","timestamp":1784804445446,"version":"3.55.0"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032325884","type":"print"},{"value":"9783032325891","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T00:00:00Z","timestamp":1784851200000},"content-version":"vor","delay-in-days":204,"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>We address generating theorems from a given set of axioms, without proof goal, aiming at value from a mathematical point of view or as lemmas for automated proving. As benchmark, we convert a fragment of the Metamath database set.mm. Our techniques are centered on proof terms and condensed detachment. This ties in with automated first-order proving by proof structure enumeration, and links to Metamath and formulas-as-types. Our methods for generating theorems are based on partitioning the set of proof terms into inductively characterized levels. We study two ideas for improvement: Lemma synthesis by DAG compression of proof term sets, and incorporating combinators into proof terms. Our lemmas significantly improve solution rates of provers, e.g., of Vampire from 74% to 94%, and of leanCoP from 7% to 44%.<\/jats:p>","DOI":"10.1007\/978-3-032-32589-1_3","type":"book-chapter","created":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T10:02:44Z","timestamp":1784800964000},"page":"41-61","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Generating Theorems by\u00a0Generating Proof Structures"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0438-8829","authenticated-orcid":false,"given":"Christoph","family":"Wernhard","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,24]]},"reference":[{"key":"3_CR1","unstructured":"Aho, A.V., Sethi, R., Ullman, J.D.: Compilers \u2013 Principles, Techniques, and Tools. Addison-Wesley (1986)"},{"key":"3_CR2","doi-asserted-by":"publisher","unstructured":"Alhessi, Y., et al.: Lemmanaid: neuro-symbolic lemma conjecturing. CoRR abs\/2504.04942 (2025). https:\/\/doi.org\/10.48550\/ARXIV.2504.04942","DOI":"10.48550\/ARXIV.2504.04942"},{"key":"3_CR3","unstructured":"Axelrod, G., Dubhashi, D., Johansson, M., Silvi, A., Smallbone, N., Stucki, S.: Learning to generate abstractions for an equational solver. In: Douglas, M.R., Hales, T.C., Kaliszyk, C., Schulz, S., Urban, J. (eds.) AITP 2025 (Informal Book of Abstracts) (2025). https:\/\/aitp-conference.org\/2025\/abstract\/AITP_2025_paper_18.pdf. Accessed 8 May 2026"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Bibel, W.: Automated Theorem Proving. Vieweg (1987). First edition 1982","DOI":"10.1007\/978-3-322-90102-6"},{"key":"3_CR5","doi-asserted-by":"publisher","unstructured":"Bibel, W., Otten, J.: From Sch\u00fctte\u2019s formal systems to modern automated deduction. In: Kahle, R., Rathjen, M. (eds.) The Legacy of Kurt Sch\u00fctte, chap.\u00a013, pp. 215\u2013249. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-49424-7_13","DOI":"10.1007\/978-3-030-49424-7_13"},{"key":"3_CR6","doi-asserted-by":"publisher","unstructured":"Blaauwbroek, L., et al.: Learning guided automated reasoning: a brief survey. In: Capretta, V., Krebbers, R., Wiedijk, F. (eds.) Logics and Type Systems in Theory and Practice - Essays Dedicated to Herman Geuvers on The Occasion of His 60th Birthday. LNCS, vol. 14560, pp. 54\u201383. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-61716-4_4","DOI":"10.1007\/978-3-031-61716-4_4"},{"key":"3_CR7","doi-asserted-by":"publisher","unstructured":"Carneiro, M., Brown, C.E., Urban, J.: Automated theorem proving for Metamath. In: Naumowicz, A., Thiemann, R. (eds.) ITP 2023. LIPIcs, vol.\u00a0268, pp. 9:1\u20139:19. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2023). https:\/\/doi.org\/10.4230\/LIPIcs.ITP.2023.9","DOI":"10.4230\/LIPIcs.ITP.2023.9"},{"key":"3_CR8","unstructured":"Curry, H., Feys, R.: Combinatory Logic, vol. I. North-Holland (1958)"},{"key":"3_CR9","unstructured":"Denzinger, J., Schulz, S.: Analysis and Representation of Equational Proofs Generated by a Distributed Completion Based Proof System. Seki-Report SR-94-05, Universit\u00e4t Kaiserslautern (1994). http:\/\/wwwlehre.dhbw-stuttgart.de\/~sschulz\/PAPERS\/DS94-SR- 94-05.ps.gz. Revised September 1997"},{"key":"3_CR10","doi-asserted-by":"publisher","unstructured":"Eder, E.: Relative Complexities of First Order Calculi. Vieweg, Braunschweig (1992). https:\/\/doi.org\/10.1007\/978-3-322-84222-0","DOI":"10.1007\/978-3-322-84222-0"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/BFb0026296","volume-title":"CSL \u201988","author":"E Eder","year":"1989","unstructured":"Eder, E.: A comparison of the resolution calculus and the connection method, and a new calculus generalizing both methods. In: B\u00f6rger, E., B\u00fcning, H.K., Richter, M.M. (eds.) CSL 1988. LNCS, vol. 385, pp. 80\u201398. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/BFb0026296"},{"key":"3_CR12","doi-asserted-by":"publisher","unstructured":"Genitrini, A., Gittenberger, B., Kauers, M., Wallner, M.: Asymptotic enumeration of compacted binary trees of bounded right height. J. Comb. Theory, Ser. A 172, 105177 (2020). https:\/\/doi.org\/10.1016\/j.jcta.2019.105177","DOI":"10.1016\/j.jcta.2019.105177"},{"key":"3_CR13","doi-asserted-by":"publisher","unstructured":"Hetzl, S.: Applying tree languages in proof theory. In: Dediu, A.H., Mart\u00edn-Vide, C. (eds.) LATA 2012. LNCS, vol.\u00a07183, pp. 301\u2013312 (2012) .https:\/\/doi.org\/10.1007\/978-3-642-28332-1_26","DOI":"10.1007\/978-3-642-28332-1_26"},{"key":"3_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511608865","author":"JR Hindley","year":"1997","unstructured":"Hindley, J.R.: Basic simple type theory. Cambridge University Press (1997). https:\/\/doi.org\/10.1017\/CBO9780511608865","journal-title":"Cambridge University Press"},{"issue":"1","key":"3_CR15","doi-asserted-by":"publisher","first-page":"90","DOI":"10.2307\/2274956","volume":"55","author":"JR Hindley","year":"1990","unstructured":"Hindley, J.R., Meredith, D.: Principal type-schemes and condensed detachment. J. Symb. Log. 55(1), 90\u2013105 (1990). https:\/\/doi.org\/10.2307\/2274956","journal-title":"J. Symb. Log."},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/J.JSC.2014.09.032","volume":"69","author":"C Kaliszyk","year":"2015","unstructured":"Kaliszyk, C., Urban, J.: Learning-assisted theorem proving with millions of lemmas. J. Symb. Comput. 69, 109\u2013128 (2015). https:\/\/doi.org\/10.1016\/J.JSC.2014.09.032","journal-title":"J. Symb. Comput."},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-319-90686-7_3","volume-title":"Functional and Logic Programming","author":"O Kiselyov","year":"2018","unstructured":"Kiselyov, O.: $$\\lambda $$ to SKI, Semantically. In: Gallagher, J.P., Sulzmann, M. (eds.) FLOPS 2018. LNCS, vol. 10818, pp. 33\u201350. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-90686-7_3"},{"key":"3_CR18","unstructured":"Kleine B\u00fcning, H., Lettmann, T.: Propositional Logic \u2013 Deduction and Algorithms. Cambridge University Press (1999)"},{"key":"3_CR19","doi-asserted-by":"publisher","unstructured":"Kov\u00e1cs, L., Voronkov, A.: First-order theorem proving and Vampire. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol.\u00a08044, pp. 1\u201335. Springer (2013). https:\/\/doi.org\/10.1007\/978-3-642-39799-8_1","DOI":"10.1007\/978-3-642-39799-8_1"},{"key":"3_CR20","unstructured":"Lee, R.C.T.: A completeness theorem and computer program for finding theorems derivable from given axioms. Ph.D. thesis, University of California, Berkeley, CA (1967)"},{"key":"3_CR21","unstructured":"Letz, R.: Tableau and Connection Calculi. Structure, Complexity, Implementation. Habilitationsschrift, TU M\u00fcnchen (1999). https:\/\/web.archive.org\/web\/20230604101128\/https:\/\/www2.tcs.ifi.lmu.de\/~letz\/habil.ps. Accessed 8 May 2026"},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-319-21500-6_3","volume-title":"Developments in Language Theory","author":"M Lohrey","year":"2015","unstructured":"Lohrey, M.: Grammar-based tree compression. In: Potapov, I. (ed.) DLT 2015. LNCS, vol. 9168, pp. 46\u201357. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21500-6_3"},{"issue":"8","key":"3_CR23","doi-asserted-by":"publisher","first-page":"1150","DOI":"10.1016\/j.is.2013.06.006","volume":"38","author":"M Lohrey","year":"2013","unstructured":"Lohrey, M., Maneth, S., Mennicke, R.: XML tree structure compression using RePair. Inf. Syst. 38(8), 1150\u20131167 (2013). https:\/\/doi.org\/10.1016\/j.is.2013.06.006","journal-title":"Inf. Syst."},{"key":"3_CR24","unstructured":"McCune, W.: Prover9 and Mace4 (2005\u20132010). http:\/\/www.cs.unm.edu\/~mccune\/prover9"},{"key":"3_CR25","unstructured":"Megill, N., Wheeler, D.A.: Metamath: A Computer Language for Mathematical Proofs. lulu.com, second edn. (2019). https:\/\/us.metamath.org\/downloads\/metamath.pdf"},{"key":"3_CR26","unstructured":"Megill, N.D.: Metamath Proof Explorer Home Page. https:\/\/us.metamath.org\/mpeuni\/mmset.html. Accessed 8 May 2026"},{"issue":"3","key":"3_CR27","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1305\/ndjfl\/1040149359","volume":"36","author":"ND Megill","year":"1995","unstructured":"Megill, N.D.: A finitely axiomatized formalization of predicate calculus with equality. Notre Dame J. of Formal Logic 36(3), 435\u2013453 (1995). https:\/\/doi.org\/10.1305\/ndjfl\/1040149359","journal-title":"Notre Dame J. of Formal Logic"},{"issue":"2\u20133","key":"3_CR28","doi-asserted-by":"publisher","first-page":"159","DOI":"10.3233\/AIC-2010-0464","volume":"23","author":"J Otten","year":"2010","unstructured":"Otten, J.: Restricting backtracking in connection calculi. AI Commun. 23(2\u20133), 159\u2013182 (2010). https:\/\/doi.org\/10.3233\/AIC-2010-0464","journal-title":"AI Commun."},{"key":"3_CR29","unstructured":"Peyton Jones, S.L.: The Implementation of Functional Programming Languages. Prentice Hall (1987). https:\/\/simon.peytonjones.org\/slpj-book-1987\/"},{"key":"3_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1007\/BFb0012869","volume-title":"9th International Conference on Automated Deduction","author":"F Pfenning","year":"1988","unstructured":"Pfenning, F.: Single axioms in the implicational propositional calculus. In: Lusk, E., Overbeek, R. (eds.) CADE 1988. LNCS, vol. 310, pp. 710\u2013713. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/BFb0012869"},{"issue":"3","key":"3_CR31","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1080\/00048405685200181","volume":"34","author":"AN Prior","year":"1956","unstructured":"Prior, A.N.: Logicians at play; or Syll, Simp and Hilbert. Australas. J. Philos. 34(3), 182\u2013192 (1956). https:\/\/doi.org\/10.1080\/00048405685200181","journal-title":"Australas. J. Philos."},{"key":"3_CR32","doi-asserted-by":"publisher","unstructured":"Rawson, M., Wernhard, C., Zombori, Z., Bibel, W.: Lemmas: Generation, selection, application. In: Ramanayake, R., Urban, J. (eds.) TABLEAUX 2023. LNAI, vol. 14278, pp. 153\u2013174 (2023). https:\/\/doi.org\/10.1007\/978-3-031-43513-3_9","DOI":"10.1007\/978-3-031-43513-3_9"},{"key":"3_CR33","unstructured":"Rawson, M., Zombori, Z., Dor\u00e9, M., Wernhard, C.: Project proposal: forward reasoning in hindsight. In: Douglas, M.R., Hales, T.C., Kaliszyk, C., Schulz, S., Urban, J. (eds.) AITP 2024 (Informal Book of Abstracts) (2024). https:\/\/aitp-conference.org\/2024\/abstract\/AITP_2024_paper_6.pdf. Accessed 8 May 2026"},{"key":"3_CR34","volume-title":"Witness Theory - Notes on $$\\lambda $$-Calculus and Logic, Studies in Logic","author":"A Rezus","year":"2020","unstructured":"Rezus, A.: Witness Theory - Notes on $$\\lambda $$-Calculus and Logic, Studies in Logic, vol. 84. College Publications, London (2020)"},{"key":"3_CR35","unstructured":"Schulz, S.: Analyse und Transformation von Gleichheitsbeweisen. Projektarbeit in informatik, Fachbereich Informatik, Universit\u00e4t Kaiserslautern (1993). http:\/\/wwwlehre.dhbw-stuttgart.de\/~sschulz\/PAPERS\/Sch93- project.ps.gz. (German Language)"},{"key":"3_CR36","doi-asserted-by":"publisher","unstructured":"Schulz, S., Cruanes, S., Vukmirovi\u0107, P.: Faster, higher, stronger: E 2.3. In: Fontaine, P. (ed.) CADE\u00a027, pp. 495\u2013507. no. 11716 in LNAI, Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-29436-6_29","DOI":"10.1007\/978-3-030-29436-6_29"},{"key":"3_CR37","doi-asserted-by":"publisher","unstructured":"Schumann, J.M.P.: DELTA \u2014 A bottom-up preprocessor for top-down theorem provers. In: CADE-12. LNCS (LNAI), vol.\u00a0814, pp. 774\u2013777. Springer (1994). https:\/\/doi.org\/10.1007\/3-540-58156-1_58","DOI":"10.1007\/3-540-58156-1_58"},{"issue":"3\u20134","key":"3_CR38","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/BF01448013","volume":"92","author":"M Sch\u00f6nfinkel","year":"1924","unstructured":"Sch\u00f6nfinkel, M.: \u00dcber die Bausteine der mathematischen Logik. Math. Ann. 92(3\u20134), 305\u2013316 (1924). https:\/\/doi.org\/10.1007\/BF01448013","journal-title":"Math. Ann."},{"key":"3_CR39","doi-asserted-by":"publisher","unstructured":"Sutcliffe, G.: The TPTP problem library and associated infrastructure. From CNF to TH0, TPTP v6.4.0. J. Autom. Reasoning 59(4), 483\u2013502 (2017). https:\/\/doi.org\/10.1007\/S10817-009-9143-8","DOI":"10.1007\/S10817-009-9143-8"},{"issue":"2","key":"3_CR40","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1023\/A:1010683508225","volume":"27","author":"D Ulrich","year":"2001","unstructured":"Ulrich, D.: A legacy recalled and a tradition continued. J. Autom. Reasoning 27(2), 97\u2013122 (2001). https:\/\/doi.org\/10.1023\/A:1010683508225","journal-title":"J. Autom. Reasoning"},{"key":"3_CR41","doi-asserted-by":"publisher","unstructured":"Vyskocil, J., Stanovsk\u00fd, D., Urban, J.: Automated proof compression by invention of new definitions. In: Clarke, E.M., Voronkov, A. (eds.) LPAR-16. LNCS, vol.\u00a06355, pp. 447\u2013462. Springer (2010). https:\/\/doi.org\/10.1007\/978-3-642-17511-4_25","DOI":"10.1007\/978-3-642-17511-4_25"},{"key":"3_CR42","unstructured":"Wernhard, C.: CD Tools. http:\/\/cs.christophwernhard.com\/cdtools\/. Accessed 8 May 2026"},{"key":"3_CR43","unstructured":"Wernhard, C.: Generating compressed combinatory proof structures \u2014 an approach to automated first-order theorem proving. In: Konev, B., Schon, C., Steen, A. (eds.) PAAR\u00a02022. CEUR Workshop Proc., vol.\u00a03201. CEUR-WS.org (2022). https:\/\/arxiv.org\/abs\/2209.12592"},{"key":"3_CR44","unstructured":"Wernhard, C.: Structure-generating first-order theorem proving. In: Otten, J., Bibel, W. (eds.) AReCCa 2023. CEUR Workshop Proceeding, vol.\u00a03613, pp. 64\u201383. CEUR-WS.org (2024). https:\/\/ceur-ws.org\/Vol-3613\/AReCCa2023_paper5.pdf"},{"key":"3_CR45","unstructured":"Wernhard, C.: Generating theorems by generating proof structures \u2013 supplementary artifacts (2026). http:\/\/cs.christophwernhard.com\/cdtools\/exp-thgen\/"},{"key":"3_CR46","unstructured":"Wernhard, C.: Generating theorems by generating proof structures (extended version). CoRR abs\/2602.15511 (2026). https:\/\/arxiv.org\/abs\/2602.15511"},{"key":"3_CR47","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-030-79876-5_4","volume-title":"Automated Deduction \u2013 CADE 28","author":"C Wernhard","year":"2021","unstructured":"Wernhard, C., Bibel, W.: Learning from \u0141ukasiewicz and Meredith: investigations into proof structures. In: Platzer, A., Sutcliffe, G. (eds.) CADE 2021. LNCS (LNAI), vol. 12699, pp. 58\u201375. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79876-5_4"},{"key":"3_CR48","doi-asserted-by":"publisher","unstructured":"Wernhard, C., Bibel, W.: Investigations into proof structures. J. Autom. Reasoning 68(24) (2024). https:\/\/doi.org\/10.1007\/s10817-024-09711-8","DOI":"10.1007\/s10817-024-09711-8"},{"key":"3_CR49","doi-asserted-by":"publisher","unstructured":"Wernhard, C., Zombori, Z.: Mathematical knowledge bases as grammar-compressed proof terms: exploring Metamath proof structures. CoRR abs\/2505.12305 (2025). https:\/\/doi.org\/10.48550\/arXiv.2505.12305","DOI":"10.48550\/arXiv.2505.12305"},{"key":"3_CR50","unstructured":"Wernhard, C., Zombori, Z.: Are proof structures machine-learnable? a study with Dag-structured proof terms (2026). In preparation"},{"issue":"1\u20132","key":"3_CR51","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1017\/S1471068411000494","volume":"12","author":"J Wielemaker","year":"2012","unstructured":"Wielemaker, J., Schrijvers, T., Triska, M., Lager, T.: SWI-Prolog. Theory Pract. Logic Program. 12(1\u20132), 67\u201396 (2012). https:\/\/doi.org\/10.1017\/S1471068411000494","journal-title":"Theory Pract. Logic Program."},{"issue":"2","key":"3_CR52","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0898-1221(94)00220-F","volume":"29","author":"L Wos","year":"1995","unstructured":"Wos, L.: The resonance strategy. Comput. Math. Applic. 29(2), 133\u2013178 (1995). https:\/\/doi.org\/10.1016\/0898-1221(94)00220-F","journal-title":"Comput. Math. Applic."},{"issue":"2","key":"3_CR53","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1023\/A:1010691726881","volume":"27","author":"L Wos","year":"2001","unstructured":"Wos, L.: Conquering the Meredith single axiom. J. Autom. Reasoning 27(2), 175\u2013199 (2001). https:\/\/doi.org\/10.1023\/A:1010691726881","journal-title":"J. Autom. Reasoning"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-32589-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T10:02:51Z","timestamp":1784800971000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-32589-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032325884","9783032325891"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-32589-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"24 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IJCAR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Joint Conference on Automated Reasoning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 July 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ijcar2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.floc26.org\/ijcar","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}