{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T17:16:35Z","timestamp":1771262195536,"version":"3.50.1"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319661575","type":"print"},{"value":"9783319661582","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-66158-2_38","type":"book-chapter","created":{"date-parts":[[2017,8,22]],"date-time":"2017-08-22T07:24:38Z","timestamp":1503386678000},"page":"596-614","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Solving Multiobjective Discrete Optimization Problems with Propositional Minimal Model Generation"],"prefix":"10.1007","author":[{"given":"Takehide","family":"Soh","sequence":"first","affiliation":[]},{"given":"Mutsunori","family":"Banbara","sequence":"additional","affiliation":[]},{"given":"Naoyuki","family":"Tamura","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Le Berre","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,23]]},"reference":[{"issue":"5","key":"38_CR1","doi-asserted-by":"publisher","first-page":"1353","DOI":"10.1016\/j.rser.2010.01.006","volume":"14","author":"A Alarcon-Rodriguez","year":"2010","unstructured":"Alarcon-Rodriguez, A., Ault, G., Galloway, S.: Multi-objective planning of distributed energy resources: a review of the state-of-the-art. Renew. Sustain. Energy Rev. 14(5), 1353\u20131366 (2010)","journal-title":"Renew. Sustain. Energy Rev."},{"key":"38_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11527695_1","volume-title":"Theory and Applications of Satisfiability Testing","author":"C Ans\u00f3tegui","year":"2005","unstructured":"Ans\u00f3tegui, C., Many\u00e0, F.: Mapping problems with finite-domain variables to problems with boolean variables. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 1\u201315. Springer, Heidelberg (2005). doi: 10.1007\/11527695_1"},{"key":"38_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-540-45193-8_8","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"O Bailleux","year":"2003","unstructured":"Bailleux, O., Boufkhad, Y.: Efficient CNF encoding of boolean cardinality constraints. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 108\u2013122. Springer, Heidelberg (2003). doi: 10.1007\/978-3-540-45193-8_8"},{"issue":"2","key":"38_CR4","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1016\/j.ejor.2011.07.011","volume":"216","author":"E Ballestero","year":"2012","unstructured":"Ballestero, E., Bravo, M., P\u00e9rez-Gladish, B., Parra, M.A., Pl\u00e0-Santamaria, D.: Socially responsible investment: a multicriteria approach to portfolio selection combining ethical and financial objectives. Eur. J. Oper. Res. 216(2), 487\u2013494 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"38_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-642-16242-8_9","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"M Banbara","year":"2010","unstructured":"Banbara, M., Matsunaka, H., Tamura, N., Inoue, K.: Generating combinatorial test cases by efficient SAT encodings suitable for CDCL SAT solvers. In: Ferm\u00fcller, C.G., Voronkov, A. (eds.) LPAR 2010. LNCS, vol. 6397, pp. 112\u2013126. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-16242-8_9"},{"key":"38_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-319-44953-1_6","volume-title":"Principles and Practice of Constraint Programming","author":"D Bergman","year":"2016","unstructured":"Bergman, D., Cire, A.A.: Multiobjective optimization by decision diagrams. In: Rueher, M. (ed.) CP 2016. LNCS, vol. 9892, pp. 86\u201395. Springer, Cham (2016). doi: 10.1007\/978-3-319-44953-1_6"},{"key":"38_CR7","volume-title":"Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications (FAIA)","year":"2009","unstructured":"Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications (FAIA), vol. 185. IOS Press, Amsterdam (2009)"},{"issue":"3","key":"38_CR8","doi-asserted-by":"publisher","first-page":"904","DOI":"10.1016\/j.ejor.2016.02.037","volume":"260","author":"N Boland","year":"2017","unstructured":"Boland, N., Charkhgard, H., Savelsbergh, M.W.P.: A new method for optimizing a linear function over the efficient set of a multiobjective integer program. Eur. J. Oper. Res. 260(3), 904\u2013919 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"38_CR9","doi-asserted-by":"crossref","unstructured":"Brewka, G., Delgrande, J.P., Romero, J., Schaub, T.: asprin: customizing answer set preferences without a headache. In: Proceedings of the 29th National Conference on Artificial Intelligence (AAAI 2015), pp. 1467\u20131474 (2015)","DOI":"10.1609\/aaai.v29i1.9398"},{"issue":"1","key":"38_CR10","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10479-009-0590-8","volume":"196","author":"EK Burke","year":"2012","unstructured":"Burke, E.K., Li, J., Qu, R.: A pareto-based search methodology for multi-objective nurse scheduling. Ann. Oper. Res. 196(1), 91\u2013109 (2012)","journal-title":"Ann. Oper. Res."},{"key":"38_CR11","unstructured":"Crawford, J.M., Baker, A.B.: Experimental results on the application of satisfiability algorithms to scheduling problems. In: Proceedings of the 12th National Conference on Artificial Intelligence (AAAI 1994), pp. 1092\u20131097 (1994)"},{"key":"38_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1007\/3-540-45356-3_83","volume-title":"Parallel Problem Solving from Nature PPSN VI","author":"K Deb","year":"2000","unstructured":"Deb, K., Agrawal, S., Pratap, A., Meyarivan, T.: A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. In: Schoenauer, M., Deb, K., Rudolph, G., Yao, X., Lutton, E., Merelo, J.J., Schwefel, H.-P. (eds.) PPSN 2000. LNCS, vol. 1917, pp. 849\u2013858. Springer, Heidelberg (2000). doi: 10.1007\/3-540-45356-3_83"},{"issue":"2","key":"38_CR13","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Agrawal, S., Pratap, A., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"38_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-27659-9","volume-title":"Multicriteria Optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott, M.: Multicriteria Optimization. Springer, Heidelberg (2005). doi: 10.1007\/3-540-27659-9"},{"key":"38_CR15","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","DOI":"10.1007\/b100605","volume-title":"Multiple Criteria Decision Analysis: State of the Art Surveys","author":"J Figueira","year":"2005","unstructured":"Figueira, J., Greco, S., Ehrgott, M.: Multiple Criteria Decision Analysis: State of the Art Surveys. International Series in Operations Research & Management Science. Springer, Heidelberg (2005). doi: 10.1007\/b100605"},{"key":"38_CR16","unstructured":"Gent, I.P., Nightingale, P.: A new encoding of alldifferent into SAT. In: Proceedings of the 3rd International Workshop on Modelling and Reformulating Constraint Satisfaction Problems (2004)"},{"issue":"16","key":"38_CR17","doi-asserted-by":"publisher","first-page":"2291","DOI":"10.1016\/j.dam.2006.04.015","volume":"154","author":"K Inoue","year":"2006","unstructured":"Inoue, K., Soh, T., Ueda, S., Sasaura, Y., Banbara, M., Tamura, N.: A competitive and cooperative approach to propositional satisfiability. Discrete Appl. Math. 154(16), 2291\u20132306 (2006)","journal-title":"Discrete Appl. Math."},{"issue":"1\u20132","key":"38_CR18","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1111\/itor.12294","volume":"24","author":"S Iturriaga","year":"2017","unstructured":"Iturriaga, S., Dorronsoro, B., Nesmachnow, S.: Multiobjective evolutionary algorithms for energy and service level scheduling in a federation of distributed datacenters. Int. Trans. Oper. Res. 24(1\u20132), 199\u2013228 (2017)","journal-title":"Int. Trans. Oper. Res."},{"issue":"3","key":"38_CR19","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/j.ejor.2013.08.001","volume":"232","author":"G Kirlik","year":"2014","unstructured":"Kirlik, G., Sayin, S.: A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems. Eur. J. Oper. Res. 232(3), 479\u2013488 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"38_CR20","volume-title":"The Art of Computer Programming, Volume 4, Fascicle 6: Satisfiability","author":"DE Knuth","year":"2015","unstructured":"Knuth, D.E.: The Art of Computer Programming, Volume 4, Fascicle 6: Satisfiability. Addison-Wesley Professional, Boston (2015)"},{"key":"38_CR21","unstructured":"Koshimura, M., Nabeshima, H., Fujita, H., Hasegawa, R.: Minimal model generation with respect to an atom set. In: Proceedings of the the 7th International Workshop on First-Order Theorem Proving (FTP 2009), pp. 49\u201359 (2009)"},{"issue":"3","key":"38_CR22","doi-asserted-by":"publisher","first-page":"932","DOI":"10.1016\/j.ejor.2004.08.029","volume":"169","author":"M Laumanns","year":"2006","unstructured":"Laumanns, M., Thiele, L., Zitzler, E.: An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method. Eur. J. Oper. Res. 169(3), 932\u2013942 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"38_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-72788-0_9","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2007","author":"M Lukasiewycz","year":"2007","unstructured":"Lukasiewycz, M., Gla\u00df, M., Haubelt, C., Teich, J.: Solving multi-objective pseudo-boolean problems. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol. 4501, pp. 56\u201369. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-72788-0_9"},{"key":"38_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1007\/978-3-642-04244-7_47","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"R Marinescu","year":"2009","unstructured":"Marinescu, R.: Exploiting problem decomposition in multi-objective constraint optimization. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 592\u2013607. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-04244-7_47"},{"key":"38_CR25","doi-asserted-by":"crossref","unstructured":"Marinescu, R.: Best-first vs. depth-first AND\/OR search for multi-objective constraint optimization. In: Proceedings of the 22nd IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2010), pp. 439\u2013446 (2010)","DOI":"10.1109\/ICTAI.2010.69"},{"key":"38_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1007\/978-3-642-23786-7_47","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2011","author":"A Metodi","year":"2011","unstructured":"Metodi, A., Codish, M., Lagoon, V., Stuckey, P.J.: Boolean equi-propagation for optimized SAT encoding. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, pp. 621\u2013636. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-23786-7_47"},{"key":"38_CR27","unstructured":"Nabeshima, H., Soh, T., Inoue, K., Iwanuma, K.: Lemma reusing for SAT based planning and scheduling. In: Proceedings of the International Conference on Automated Planning and Scheduling 2006 (ICAPS 2006), pp. 103\u2013112 (2006)"},{"key":"38_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/3-540-61208-4_18","volume-title":"Theorem Proving with Analytic Tableaux and Related Methods","author":"I Niemel\u00e4","year":"1996","unstructured":"Niemel\u00e4, I.: A tableau calculus for minimal model reasoning. In: Miglioli, P., Moscato, U., Mundici, D., Ornaghi, M. (eds.) TABLEAUX 1996. LNCS, vol. 1071, pp. 278\u2013294. Springer, Heidelberg (1996). doi: 10.1007\/3-540-61208-4_18"},{"issue":"3","key":"38_CR29","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s10601-008-9064-x","volume":"14","author":"O Ohrimenko","year":"2009","unstructured":"Ohrimenko, O., Stuckey, P.J., Codish, M.: Propagation via lazy clause generation. Constraints 14(3), 357\u2013391 (2009)","journal-title":"Constraints"},{"key":"38_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/978-3-642-33558-7_41","volume-title":"Principles and Practice of Constraint Programming","author":"T Okimoto","year":"2012","unstructured":"Okimoto, T., Joe, Y., Iwasaki, A., Matsui, T., Hirayama, K., Yokoo, M.: Interactive algorithm for multi-objective constraint optimization. In: Milano, M. (ed.) CP 2012. LNCS, pp. 561\u2013576. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-33558-7_41"},{"issue":"2","key":"38_CR31","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1007\/s10957-013-0364-y","volume":"160","author":"M Ozlen","year":"2014","unstructured":"Ozlen, M., Burton, B.A., MacRae, C.A.G.: Multi-objective integer programming: an improved recursive algorithm. J. Optim. Theory Appl. 160(2), 470\u2013482 (2014)","journal-title":"J. Optim. Theory Appl."},{"key":"38_CR32","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Yannakakis, M.: On the approximability of trade-offs and optimal access of web sources. In: Proceedings of the 41st Annual Symposium on Foundations of Computer Science (FOCS 2000), pp. 86\u201392 (2000)","DOI":"10.1109\/SFCS.2000.892068"},{"issue":"4\u20135","key":"38_CR33","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10732-006-6726-y","volume":"12","author":"E Rollon","year":"2006","unstructured":"Rollon, E., Larrosa, J.: Bucket elimination for multiobjective optimization problems. J. Heuristics 12(4\u20135), 307\u2013328 (2006)","journal-title":"J. Heuristics"},{"key":"38_CR34","unstructured":"Rollon, E., Larrosa, J.: Multi-objective russian doll search. In: Proceedings of the 22nd National Conference on Artificial Intelligence (AAAI 2007), pp. 249\u2013254 (2007)"},{"key":"38_CR35","doi-asserted-by":"crossref","unstructured":"Schwind, N., Okimoto, T., Konieczny, S., Wack, M., Inoue, K.: Utilitarian and egalitarian solutions for multi-objective constraint optimization. In: Proceedings of the 26th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2014), pp. 170\u2013177. IEEE Computer Society (2014)","DOI":"10.1109\/ICTAI.2014.34"},{"issue":"1","key":"38_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0218213017600053","volume":"26","author":"T Soh","year":"2017","unstructured":"Soh, T., Banbara, M., Tamura, N.: Proposal and evaluation of hybrid encoding of CSP to SAT integrating order and log encodings. Int. J. Artif. Intell. Tools 26(1), 1\u201329 (2017)","journal-title":"Int. J. Artif. Intell. Tools"},{"issue":"3\u20134","key":"38_CR37","doi-asserted-by":"crossref","first-page":"467","DOI":"10.3233\/FI-2010-314","volume":"102","author":"T Soh","year":"2010","unstructured":"Soh, T., Inoue, K., Tamura, N., Banbara, M., Nabeshima, H.: A SAT-based method for solving the two-dimensional strip packing problem. Fundam. Inf. 102(3\u20134), 467\u2013487 (2010)","journal-title":"Fundam. Inf."},{"key":"38_CR38","doi-asserted-by":"crossref","unstructured":"Tamura, N., Banbara, M., Soh, T.: PBSugar: Compiling pseudo-boolean constraints to SAT with order encoding. In: Proceedings of the 25th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2013), pp. 1020\u20131027. IEEE, November 2013","DOI":"10.1109\/ICTAI.2013.153"},{"issue":"2","key":"38_CR39","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/s10601-008-9061-0","volume":"14","author":"N Tamura","year":"2009","unstructured":"Tamura, N., Taga, A., Kitagawa, S., Banbara, M.: Compiling finite linear CSP into SAT. Constraints 14(2), 254\u2013272 (2009)","journal-title":"Constraints"},{"key":"38_CR40","unstructured":"Tanjo, T., Tamura, N., Banbara, M.: Sugar++: a SAT-based Max-CSP\/COP solver. In: Proceedings of the 3rd International CSP Solver Competition, pp. 77\u201382 (2008)"},{"key":"38_CR41","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.artint.2015.04.003","volume":"244","author":"W Ugarte","year":"2017","unstructured":"Ugarte, W., Boizumault, P., Cr\u00e9milleux, B., Lepailleur, A., Loudni, S., Plantevit, M., Ra\u00efssi, C., Soulet, A.: Skypattern mining: from pattern condensed representations to dynamic constraint satisfaction problems. Artif. Intell. 244, 48\u201369 (2017). https:\/\/doi.org\/10.1016\/j.artint.2015.04.003","journal-title":"Artif. Intell."},{"key":"38_CR42","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-85729-652-8","volume-title":"Multi-objective Evolutionary Optimisation for Product Design and Manufacturing","year":"2011","unstructured":"Wang, L., Ng, A.H.C., Deb, K. (eds.): Multi-objective Evolutionary Optimisation for Product Design and Manufacturing. Springer, Heidelberg (2011). doi: 10.1007\/978-0-85729-652-8"},{"key":"38_CR43","unstructured":"Wilson, N., Razak, A., Marinescu, R.: Computing possibly optimal solutions for multi-objective constraint optimisation with tradeoffs. In: Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015), pp. 815\u2013822 (2015)"},{"key":"38_CR44","unstructured":"Yi, D., Goodrich, M.A., Seppi, K.D.: MORRF*: sampling-based multi-objective motion planning. In: Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015), pp. 1733\u20131741 (2015)"},{"key":"38_CR45","unstructured":"Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: improving the strength pareto evolutionary algorithm for multiobjective optimization. In: Proceedings of the 4th International Conference of Evolutionary Methods for Design, Optimisation and Control with Application to Industrial Problems (EUROGEN 2001), pp. 95\u2013100 (2002)"},{"key":"38_CR46","doi-asserted-by":"crossref","unstructured":"Zitzler, E., K\u00fcnzli, S.: Indicator-based selection in multiobjective search. In: Proceedings of the 8th International Conference on Parallel Problem Solving from Nature (PPSN VIII), pp. 832\u2013842 (2004)","DOI":"10.1007\/978-3-540-30217-9_84"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-66158-2_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T00:38:56Z","timestamp":1750811936000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-66158-2_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319661575","9783319661582"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66158-2_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"23 August 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Principles and Practice of Constraint Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cp2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cp2017.a4cp.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}