{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,4]],"date-time":"2026-08-04T22:40:50Z","timestamp":1785883250891,"version":"3.56.0"},"publisher-location":"Cham","reference-count":73,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030802226","type":"print"},{"value":"9783030802233","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-80223-3_18","type":"book-chapter","created":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T14:13:49Z","timestamp":1625148829000},"page":"251-269","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["SAT-Based Rigorous Explanations for Decision Lists"],"prefix":"10.1007","author":[{"given":"Alexey","family":"Ignatiev","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joao","family":"Marques-Silva","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,7,2]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Angelino, E., Larus-Stone, N., Alabi, D., Seltzer, M.I., Rudin, C.: Learning certifiably optimal rule lists. In: KDD, pp. 35\u201344 (2017)","DOI":"10.1145\/3097983.3098047"},{"key":"18_CR2","unstructured":"Angelino, E., Larus-Stone, N., Alabi, D., Seltzer, M.I., Rudin, C.: Learning certifiably optimal rule lists for categorical data. J. Mach. Learn. Res. 18, 234:1\u2013234:78 (2017). http:\/\/jmlr.org\/papers\/v18\/17-716.html"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Audemard, G., Koriche, F., Marquis, P.: On tractable XAI queries based on compiled representations. In: KR, pp. 838\u2013849 (2020)","DOI":"10.24963\/kr.2020\/86"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Audemard, G., Lagniez, J., Simon, L.: Improving glucose for incremental SAT solving with assumptions: application to MUS extraction. In: SAT, pp. 309\u2013317 (2013)","DOI":"10.1007\/978-3-642-39071-5_23"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Bailey, J., Stuckey, P.J.: Discovery of minimal unsatisfiable subsets of constraints using hitting set dualization. In: PADL, pp. 174\u2013186 (2005)","DOI":"10.1007\/978-3-540-30557-6_14"},{"issue":"2","key":"18_CR6","doi-asserted-by":"publisher","first-page":"97","DOI":"10.3233\/AIC-2012-0523","volume":"25","author":"A Belov","year":"2012","unstructured":"Belov, A., Lynce, I., Marques-Silva, J.: Towards efficient MUS extraction. AI Commun. 25(2), 97\u2013116 (2012)","journal-title":"AI Commun."},{"key":"18_CR7","unstructured":"Belov, A., Marques-Silva, J.: Accelerating MUS extraction with recursive model rotation. In: FMCAD, pp. 37\u201340 (2011)"},{"key":"18_CR8","unstructured":"Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Frontiers in Artificial Intelligence and Applications, vol. 336. IOS Press, Amsterdam (2021)"},{"issue":"1","key":"18_CR9","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1080\/0952813021000026795","volume":"15","author":"E Birnbaum","year":"2003","unstructured":"Birnbaum, E., Lozinskii, E.L.: Consistent subsets of inconsistent systems: structure and behaviour. J. Exp. Theor. Artif. Intell. 15(1), 25\u201346 (2003)","journal-title":"J. Exp. Theor. Artif. Intell."},{"key":"18_CR10","unstructured":"Bouckaert, R.R., et al.: WEKA - experiences with a java open-source project. J. Mach. Learn. Res. 11, 2533\u20132541 (2010). http:\/\/portal.acm.org\/citation.cfm?id=1953016"},{"key":"18_CR11","unstructured":"Camburu, O., Giunchiglia, E., Foerster, J., Lukasiewicz, T., Blunsom, P.: Can I trust the explainer? verifying post-hoc explanatory methods. CoRR abs\/1910.02065 (2019). http:\/\/arxiv.org\/abs\/1910.02065"},{"key":"18_CR12","unstructured":"Chen, C., Rudin, C.: An optimization approach to learning falling rule lists. In: AISTATS, pp. 604\u2013612 (2018)"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Chen, T., Guestrin, C.: XGBoost: a scalable tree boosting system. In: KDD, pp. 785\u2013794 (2016)","DOI":"10.1145\/2939672.2939785"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Clark, P., Boswell, R.: Rule induction with CN2: some recent improvements. In: EWSL, pp. 151\u2013163 (1991)","DOI":"10.1007\/BFb0017011"},{"key":"18_CR15","first-page":"261","volume":"3","author":"P Clark","year":"1989","unstructured":"Clark, P., Niblett, T.: The CN2 induction algorithm. Mach. Learn. 3, 261\u2013283 (1989)","journal-title":"Mach. Learn."},{"key":"18_CR16","unstructured":"Cohen, W.W.: Efficient pruning methods for separate-and-conquer rule learning systems. In: Bajcsy, R. (ed.) Proceedings of the 13th International Joint Conference on Artificial Intelligence, 28 August\u20133 September 1993, Chamb\u00e9ry, France. pp. 988\u2013994. Morgan Kaufmann (1993)"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Cohen, W.W.: Fast effective rule induction. In: ICML, pp. 115\u2013123 (1995)","DOI":"10.1016\/B978-1-55860-377-6.50023-2"},{"key":"18_CR18","unstructured":"Cohen, W.W., Singer, Y.: A simple, fast, and effictive rule learner. In: AAAI, pp. 335\u2013342 (1999)"},{"key":"18_CR19","doi-asserted-by":"publisher","unstructured":"Darwiche, A., Hirth, A.: On the reasons behind decisions. In: ECAI, pp. 712\u2013720 (2020). https:\/\/doi.org\/10.3233\/FAIA200158","DOI":"10.3233\/FAIA200158"},{"key":"18_CR20","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1613\/jair.989","volume":"17","author":"A Darwiche","year":"2002","unstructured":"Darwiche, A., Marquis, P.: A knowledge compilation map. J. Artif. Intell. Res. 17, 229\u2013264 (2002)","journal-title":"J. Artif. Intell. Res."},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Davies, J., Bacchus, F.: Solving MAXSAT by solving a sequence of simpler SAT instances. In: CP, pp. 225\u2013239 (2011)","DOI":"10.1007\/978-3-642-23786-7_19"},{"key":"18_CR22","unstructured":"Demsar, J., et al.: Orange: data mining toolbox in python. J. Mach. Learn. Res. 14(1), 2349\u20132353 (2013). http:\/\/dl.acm.org\/citation.cfm?id=2567736, https:\/\/orangedatamining.com\/"},{"key":"18_CR23","unstructured":"Auditing black-box predictive models. https:\/\/blog.fastforwardlabs.com\/2017\/03\/09\/fairml-auditing-black-box-predictive-models.html (2016)"},{"key":"18_CR24","unstructured":"Friedler, S., Scheidegger, C., Venkatasubramanian, S.: On algorithmic fairness, discrimination and disparate impact (2015)"},{"key":"18_CR25","doi-asserted-by":"crossref","unstructured":"Ignatiev, A.: Towards trustable explainable AI. In: IJCAI, pp. 5154\u20135158 (2020)","DOI":"10.24963\/ijcai.2020\/726"},{"issue":"2","key":"18_CR26","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s10601-015-9195-9","volume":"21","author":"A Ignatiev","year":"2016","unstructured":"Ignatiev, A., Janota, M., Marques-Silva, J.: Quantified maximum satisfiability. Constraints An Int. J. 21(2), 277\u2013302 (2016)","journal-title":"Constraints An Int. J."},{"key":"18_CR27","unstructured":"Ignatiev, A., Morgado, A., Marques-Silva, J.: Propositional abduction with implicit hitting sets. In: ECAI, pp. 1327\u20131335 (2016)"},{"key":"18_CR28","doi-asserted-by":"crossref","unstructured":"Ignatiev, A., Morgado, A., Marques-Silva, J.: PySAT: A Python toolkit for prototyping with SAT oracles. In: SAT, pp. 428\u2013437 (2018)","DOI":"10.1007\/978-3-319-94144-8_26"},{"issue":"1","key":"18_CR29","first-page":"53","volume":"11","author":"A Ignatiev","year":"2019","unstructured":"Ignatiev, A., Morgado, A., Marques-Silva, J.: RC2: an efficient MaxSAT solver. J. Satisf. Boolean Model. Comput. 11(1), 53\u201364 (2019)","journal-title":"J. Satisf. Boolean Model. Comput."},{"key":"18_CR30","doi-asserted-by":"crossref","unstructured":"Ignatiev, A., Morgado, A., Weissenbacher, G., Marques-Silva, J.: Model-based diagnosis with multiple observations. In: IJCAI, pp. 1108\u20131115 (2019)","DOI":"10.24963\/ijcai.2019\/155"},{"key":"18_CR31","unstructured":"Ignatiev, A., Narodytska, N., Asher, N., Marques-Silva, J.: From contrastive to abductive explanations and back again. In: AI*IA (2020). preliminary version available from https:\/\/arxiv.org\/abs\/2012.11067"},{"key":"18_CR32","doi-asserted-by":"crossref","unstructured":"Ignatiev, A., Narodytska, N., Marques-Silva, J.: Abduction-based explanations for machine learning models. In: AAAI, pp. 1511\u20131519 (2019)","DOI":"10.1609\/aaai.v33i01.33011511"},{"key":"18_CR33","unstructured":"Ignatiev, A., Narodytska, N., Marques-Silva, J.: On relating explanations and adversarial examples. In: NeurIPS, pp. 15857\u201315867 (2019)"},{"key":"18_CR34","unstructured":"Ignatiev, A., Narodytska, N., Marques-Silva, J.: On validating, repairing and refining heuristic ML explanations. CoRR abs\/1907.02509 (2019). http:\/\/arxiv.org\/abs\/1907.02509"},{"key":"18_CR35","doi-asserted-by":"crossref","unstructured":"Ignatiev, A., Pereira, F., Narodytska, N., Marques-Silva, J.: A sat-based approach to learn explainable decision sets. In: IJCAR, pp. 627\u2013645 (2018)","DOI":"10.1007\/978-3-319-94205-6_41"},{"key":"18_CR36","doi-asserted-by":"crossref","unstructured":"Ignatiev, A., Previti, A., Liffiton, M.H., Marques-Silva, J.: Smallest MUS extraction with minimal hitting set dualization. In: CP, pp. 173\u2013182 (2015)","DOI":"10.1007\/978-3-319-23219-5_13"},{"key":"18_CR37","unstructured":"Izza, Y., Ignatiev, A., Marques-Silva, J.: On explaining decision trees. CoRR abs\/2010.11034 (2020)"},{"key":"18_CR38","unstructured":"Junker, U.: QUICKXPLAIN: preferred explanations and relaxations for over-constrained problems. In: AAAI, pp. 167\u2013172 (2004)"},{"key":"18_CR39","doi-asserted-by":"crossref","unstructured":"Lakkaraju, H., Bach, S.H., Leskovec, J.: Interpretable decision sets: a joint framework for description and prediction. In: KDD, pp. 1675\u20131684 (2016)","DOI":"10.1145\/2939672.2939874"},{"key":"18_CR40","doi-asserted-by":"crossref","unstructured":"Lakkaraju, H., Bastani, O.: \u201cHow do I fool you?\u201d: manipulating user trust via misleading black box explanations. In: AIES, pp. 79\u201385 (2020)","DOI":"10.1145\/3375627.3375833"},{"key":"18_CR41","doi-asserted-by":"crossref","unstructured":"Liffiton, M.H., Malik, A.: Enumerating infeasibility: finding multiple MUSes quickly. In: CPAIOR, pp. 160\u2013175 (2013)","DOI":"10.1007\/978-3-642-38171-3_11"},{"issue":"4","key":"18_CR42","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s10601-008-9058-8","volume":"14","author":"MH Liffiton","year":"2009","unstructured":"Liffiton, M.H., Mneimneh, M.N., Lynce, I., Andraus, Z.S., Marques-Silva, J., Sakallah, K.A.: A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas. Constraints An Int. J. 14(4), 415\u2013442 (2009)","journal-title":"Constraints An Int. J."},{"issue":"2","key":"18_CR43","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s10601-015-9183-0","volume":"21","author":"MH Liffiton","year":"2016","unstructured":"Liffiton, M.H., Previti, A., Malik, A., Marques-Silva, J.: Fast, flexible MUS enumeration. Constraints An Int. J. 21(2), 223\u2013250 (2016)","journal-title":"Constraints An Int. J."},{"key":"18_CR44","doi-asserted-by":"crossref","unstructured":"Liffiton, M.H., Sakallah, K.A.: On finding all minimally unsatisfiable subformulas. In: SAT, pp. 173\u2013186 (2005)","DOI":"10.1007\/11499107_13"},{"issue":"1","key":"18_CR45","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10817-007-9084-z","volume":"40","author":"MH Liffiton","year":"2008","unstructured":"Liffiton, M.H., Sakallah, K.A.: Algorithms for computing minimal unsatisfiable subsets of constraints. J. Autom. Reasoning 40(1), 1\u201333 (2008)","journal-title":"J. Autom. Reasoning"},{"issue":"10","key":"18_CR46","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/3233231","volume":"61","author":"ZC Lipton","year":"2018","unstructured":"Lipton, Z.C.: The mythos of model interpretability. Commun. ACM 61(10), 36\u201343 (2018)","journal-title":"Commun. ACM"},{"key":"18_CR47","unstructured":"Lundberg, S.M., Lee, S.: A unified approach to interpreting model predictions. In: NeurIPS, pp. 4765\u20134774 (2017)"},{"key":"18_CR48","unstructured":"Lynce, I., Marques-Silva, J.: On computing minimum unsatisfiable cores. In: SAT (2004)"},{"key":"18_CR49","unstructured":"Marques-Silva, J., Gerspacher, T., Cooper, M.C., Ignatiev, A., Narodytska, N.: Explaining Naive Bayes and other linear classifiers with polynomial time and delay. In: NeurIPS (2020)"},{"key":"18_CR50","unstructured":"Marques-Silva, J., Heras, F., Janota, M., Previti, A., Belov, A.: On computing minimal correction subsets. In: IJCAI, pp. 615\u2013622 (2013)"},{"key":"18_CR51","doi-asserted-by":"crossref","unstructured":"Marques-Silva, J., Lynce, I.: On improving MUS extraction algorithms. In: SAT, pp. 159\u2013173 (2011)","DOI":"10.1007\/978-3-642-21581-0_14"},{"key":"18_CR52","doi-asserted-by":"crossref","unstructured":"Mencia, C., Ignatiev, A., Previti, A., Marques-Silva, J.: MCS extraction with sublinear oracle queries. In: SAT, pp. 342\u2013360 (2016)","DOI":"10.1007\/978-3-319-40970-2_21"},{"key":"18_CR53","unstructured":"Mencia, C., Previti, A., Marques-Silva, J.: Literal-based MCS extraction. In: IJCAI, pp. 1973\u20131979 (2015)"},{"key":"18_CR54","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2018.07.007","volume":"267","author":"T Miller","year":"2019","unstructured":"Miller, T.: Explanation in artificial intelligence: insights from the social sciences. Artif. Intell. 267, 1\u201338 (2019)","journal-title":"Artif. Intell."},{"key":"18_CR55","doi-asserted-by":"crossref","unstructured":"Morgado, A., Liffiton, M.H., Marques-Silva, J.: MaxSAT-based MCS enumeration. In: HVC, pp. 86\u2013101 (2012)","DOI":"10.1007\/978-3-642-39611-3_13"},{"key":"18_CR56","doi-asserted-by":"crossref","unstructured":"de Moura, L.M., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: TACAS, pp. 337\u2013340 (2008)","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"18_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-030-24258-9_19","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2019","author":"N Narodytska","year":"2019","unstructured":"Narodytska, N., Shrotri, A., Meel, K.S., Ignatiev, A., Marques-Silva, J.: Assessing heuristic machine learning explanations with model counting. In: Janota, M., Lynce, I. (eds.) SAT 2019. LNCS, vol. 11628, pp. 267\u2013278. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24258-9_19"},{"key":"18_CR58","unstructured":"Penn Machine Learning Benchmarks. https:\/\/github.com\/EpistasisLab\/penn-ml-benchmarks"},{"key":"18_CR59","doi-asserted-by":"crossref","unstructured":"Prestwich, S.D.: CNF encodings. In: Handbook of Satisfiability: Second Edition, Frontiers in Artificial Intelligence and Applications, vol. 336, pp. 75\u2013100. IOS Press (2021)","DOI":"10.3233\/FAIA200985"},{"key":"18_CR60","doi-asserted-by":"crossref","unstructured":"Previti, A., Marques-Silva, J.: Partial MUS enumeration. In: AAAI (2013)","DOI":"10.1609\/aaai.v27i1.8657"},{"issue":"1","key":"18_CR61","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0004-3702(87)90062-2","volume":"32","author":"R Reiter","year":"1987","unstructured":"Reiter, R.: A theory of diagnosis from first principles. Artif. Intell. 32(1), 57\u201395 (1987)","journal-title":"Artif. Intell."},{"key":"18_CR62","doi-asserted-by":"crossref","unstructured":"Ribeiro, M.T., Singh, S., Guestrin, C.: \u201cWhy should I trust you?\u201d: explaining the predictions of any classifier. In: KDD, pp. 1135\u20131144 (2016)","DOI":"10.1145\/2939672.2939778"},{"key":"18_CR63","doi-asserted-by":"crossref","unstructured":"Ribeiro, M.T., Singh, S., Guestrin, C.: Anchors: high-precision model-agnostic explanations. In: AAAI, pp. 1527\u20131535 (2018)","DOI":"10.1609\/aaai.v32i1.11491"},{"key":"18_CR64","doi-asserted-by":"publisher","unstructured":"Rivest, R.L.: Learning decision lists. Mach. Learn. 2(3), 229\u2013246 (1987). https:\/\/doi.org\/10.1007\/BF00058680","DOI":"10.1007\/BF00058680"},{"key":"18_CR65","doi-asserted-by":"publisher","unstructured":"Rudin, C., Ertekin, S.: Learning customized and optimized lists of rules with mathematical programming. Math. Program. Comput. 10(4), 659\u2013702 (2018). https:\/\/doi.org\/10.1007\/s12532-018-0143-8","DOI":"10.1007\/s12532-018-0143-8"},{"key":"18_CR66","doi-asserted-by":"crossref","unstructured":"Shih, A., Choi, A., Darwiche, A.: A symbolic approach to explaining Bayesian network classifiers. In: IJCAI, pp. 5103\u20135111 (2018)","DOI":"10.24963\/ijcai.2018\/708"},{"key":"18_CR67","doi-asserted-by":"crossref","unstructured":"Shih, A., Choi, A., Darwiche, A.: Compiling Bayesian network classifiers into decision graphs. In: AAAI, pp. 7966\u20137974 (2019)","DOI":"10.1609\/aaai.v33i01.33017966"},{"key":"18_CR68","doi-asserted-by":"crossref","unstructured":"Slack, D., Hilgard, S., Jia, E., Singh, S., Lakkaraju, H.: Fooling LIME and SHAP: adversarial attacks on post hoc explanation methods. In: AIES, pp. 180\u2013186 (2020)","DOI":"10.1145\/3375627.3375830"},{"key":"18_CR69","unstructured":"UCI Machine Learning Repository. https:\/\/archive.ics.uci.edu\/ml"},{"key":"18_CR70","doi-asserted-by":"crossref","unstructured":"Umans, C., Villa, T., Sangiovanni-Vincentelli, A.L.: Complexity of two-level logic minimization. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 25(7), 1230\u20131246 (2006)","DOI":"10.1109\/TCAD.2005.855944"},{"key":"18_CR71","unstructured":"Wang, F., Rudin, C.: Falling rule lists. In: AISTATS (2015)"},{"key":"18_CR72","unstructured":"Yang, F., Yang, Z., Cohen, W.W.: Differentiable learning of logical rules for knowledge base reasoning. In: NeurIPS, pp. 2319\u20132328 (2017)"},{"key":"18_CR73","doi-asserted-by":"crossref","unstructured":"Yang, H., Rudin, C., Seltzer, M.I.: Scalable bayesian rule lists. In: ICML, pp. 3921\u20133930 (2017)","DOI":"10.32614\/CRAN.package.sbrl"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-80223-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T03:16:20Z","timestamp":1725333380000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-80223-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030802226","9783030802233"],"references-count":73,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-80223-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"2 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Applications of Satisfiability Testing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Barcelona","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sat2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iiia.csic.es\/sat2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}