{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,4]],"date-time":"2025-10-04T22:05:25Z","timestamp":1759615525542,"version":"3.40.3"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030867713"},{"type":"electronic","value":"9783030867720"}],"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-86772-0_20","type":"book-chapter","created":{"date-parts":[[2021,9,21]],"date-time":"2021-09-21T11:05:54Z","timestamp":1632222354000},"page":"268-283","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Fine-Tuning the Odds in Bayesian Networks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3571-2502","authenticated-orcid":false,"given":"Bahare","family":"Salmani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6143-1926","authenticated-orcid":false,"given":"Joost-Pieter","family":"Katoen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,19]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Baier, C., Hensel, C., Hutschenreiter, L., Junges, S., Katoen, J., Klein, J.: Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination. Inf. Comput. 272, 104504 (2020)","DOI":"10.1016\/j.ic.2019.104504"},{"key":"20_CR2","unstructured":"Baier, C., Katoen, J.: Principles of Model Checking. MIT Press (2008)"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-642-54862-8_43","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"C Baier","year":"2014","unstructured":"Baier, C., Klein, J., Kl\u00fcppelholz, S., M\u00e4rcker, S.: Computing conditional probabilities in Markovian models efficiently. In: \u00c1brah\u00e1m, E., Havelund, K. (eds.) TACAS 2014. LNCS, vol. 8413, pp. 515\u2013530. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54862-8_43"},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-642-19835-9_30","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E Bartocci","year":"2011","unstructured":"Bartocci, E., Grosu, R., Katsaros, P., Ramakrishnan, C.R., Smolka, S.A.: Model repair for probabilistic systems. In: Abdulla, P.A., Leino, K.R.M. (eds.) TACAS 2011. LNCS, vol. 6605, pp. 326\u2013340. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19835-9_30"},{"key":"20_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-030-64276-1_12","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2020","author":"E Bartocci","year":"2020","unstructured":"Bartocci, E., Kov\u00e1cs, L., Stankovi\u010d, M.: Analysis of Bayesian networks via prob-solvable loops. In: Pun, V.K.I., Stolz, V., Simao, A. (eds.) ICTAC 2020. LNCS, vol. 12545, pp. 221\u2013241. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64276-1_12"},{"key":"20_CR6","unstructured":"Beaumont, P., Huth, M.: Constrained Bayesian Networks: Theory, Optimization, and Applications. CoRR https:\/\/arxiv.org\/abs\/1705.05326 (2017)"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-319-20807-7_19","volume-title":"Symbolic and Quantitative Approaches to Reasoning with Uncertainty","author":"JH Bolt","year":"2015","unstructured":"Bolt, J.H., van der Gaag, L.C.: Balanced tuning of multi-dimensional Bayesian network classifiers. In: Destercke, S., Denoeux, T. (eds.) ECSQARU 2015. LNCS (LNAI), vol. 9161, pp. 210\u2013220. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-20807-7_19"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-662-54580-5_9","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"CE Budde","year":"2017","unstructured":"Budde, C.E., Dehnert, C., Hahn, E.M., Hartmanns, A., Junges, S., Turrini, A.: JANI: quantitative model and tool interaction. In: Legay, A., Margaria, T. (eds.) TACAS 2017. LNCS, vol. 10206, pp. 151\u2013168. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54580-5_9"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/3-540-60112-0_11","volume-title":"Symbolic and Quantitative Approaches to Reasoning and Uncertainty","author":"E Castillo","year":"1995","unstructured":"Castillo, E., Guti\u00e9rrez, J.M., Hadi, A.S.: Parametric structure of probabilities in Bayesian networks. In: Froidevaux, C., Kohlas, J. (eds.) ECSQARU 1995. LNCS, vol. 946, pp. 89\u201398. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60112-0_11"},{"key":"20_CR10","unstructured":"Castillo, E.F., Guti\u00e9rrez, J.M., Hadi, A.S.: Goal oriented symbolic propagation in Bayesian networks. In: AAAI\/IAAI, vol. 2. pp. 1263\u20131268. AAAI Press\/The MIT Press (1996)"},{"issue":"4","key":"20_CR11","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1109\/3468.594909","volume":"27","author":"EF Castillo","year":"1997","unstructured":"Castillo, E.F., Guti\u00e9rrez, J.M., Hadi, A.S.: Sensitivity analysis in discrete Bayesian networks. IEEE Trans. Syst. Man Cybern. Part A 27(4), 412\u2013423 (1997)","journal-title":"IEEE Trans. Syst. Man Cybern. Part A"},{"issue":"2","key":"20_CR12","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S0954-1810(96)00030-1","volume":"11","author":"EF Castillo","year":"1997","unstructured":"Castillo, E.F., Guti\u00e9rrez, J.M., Hadi, A.S., Solares, C.: Symbolic propagation and sensitivity analysis in Gaussian Bayesian networks with application to damage assessment. Artif. Intell. Eng. 11(2), 173\u2013181 (1997)","journal-title":"Artif. Intell. Eng."},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1613\/jair.967","volume":"17","author":"H Chan","year":"2002","unstructured":"Chan, H., Darwiche, A.: When do numbers really matter? J. Artif. Intell. Res. 17, 265\u2013287 (2002)","journal-title":"J. Artif. Intell. Res."},{"key":"20_CR14","unstructured":"Chan, H., Darwiche, A.: Sensitivity analysis in Bayesian networks: from single to multiple parameters. In: UAI, pp. 67\u201375. AUAI Press (2004)"},{"issue":"2","key":"20_CR15","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.ijar.2004.07.001","volume":"38","author":"H Chan","year":"2005","unstructured":"Chan, H., Darwiche, A.: A distance measure for bounding probabilistic belief change. Int. J. Approx. Reason. 38(2), 149\u2013174 (2005)","journal-title":"Int. J. Approx. Reason."},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Chen, T., Hahn, E.M., Han, T., Kwiatkowska, M.Z., Qu, H., Zhang, L.: Model repair for Markov decision processes. In: TASE. IEEE (2013)","DOI":"10.1109\/TASE.2013.20"},{"issue":"4","key":"20_CR17","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1023\/A:1016398407857","volume":"36","author":"VMH Coup\u00e9","year":"2002","unstructured":"Coup\u00e9, V.M.H., van der Gaag, L.C.: Properties of sensitivity analysis of Bayesian belief networks. Ann. Math. Artif. Intell. 36(4), 323\u2013356 (2002)","journal-title":"Ann. Math. Artif. Intell."},{"key":"20_CR18","volume-title":"Practicable sensitivity analysis of Bayesian belief networks","author":"VM Coupe","year":"1998","unstructured":"Coupe, V.M., van der Gaag, L.C.: Practicable sensitivity analysis of Bayesian belief networks, vol. 1998. Utrecht University, Information and Computing Sciences (1998)"},{"issue":"3","key":"20_CR19","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1017\/S0269888900003027","volume":"15","author":"VM Coup\u00e9","year":"2000","unstructured":"Coup\u00e9, V.M., van der Gaag, L.C., Habbema, J.D.F.: Sensitivity analysis: an aid for belief-network quantification. Knowl. Eng. Rev. 15(3), 215\u2013232 (2000)","journal-title":"Knowl. Eng. Rev."},{"key":"20_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-662-54580-5_8","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M Cubuktepe","year":"2017","unstructured":"Cubuktepe, M., et al.: Sequential convex programming for the efficient verification of parametric MDPs. In: Legay, A., Margaria, T. (eds.) TACAS 2017. LNCS, vol. 10206, pp. 133\u2013150. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54580-5_8"},{"key":"20_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-030-01090-4_10","volume-title":"Automated Technology for Verification and Analysis","author":"M Cubuktepe","year":"2018","unstructured":"Cubuktepe, M., Jansen, N., Junges, S., Katoen, J.-P., Topcu, U.: Synthesis in pMDPs: a tale of 1001 parameters. In: Lahiri, S.K., Wang, C. (eds.) ATVA 2018. LNCS, vol. 11138, pp. 160\u2013176. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-01090-4_10"},{"key":"20_CR22","doi-asserted-by":"crossref","unstructured":"Darwiche, A.: Modeling and Reasoning with Bayesian Networks. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511811357"},{"key":"20_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-540-31862-0_21","volume-title":"Theoretical Aspects of Computing - ICTAC 2004","author":"C Daws","year":"2005","unstructured":"Daws, C.: Symbolic and parametric model checking of discrete-time markov chains. In: Liu, Z., Araki, K. (eds.) ICTAC 2004. LNCS, vol. 3407, pp. 280\u2013294. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31862-0_21"},{"key":"20_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-319-21690-4_13","volume-title":"Computer Aided Verification","author":"C Dehnert","year":"2015","unstructured":"Dehnert, C., et al.: PROPhESY: a probabilistic parameter synthesis tool. In: Kroening, D., P\u0103s\u0103reanu, C.S. (eds.) CAV 2015. LNCS, vol. 9206, pp. 214\u2013231. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21690-4_13"},{"key":"20_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1007\/978-3-319-63390-9_31","volume-title":"Computer Aided Verification","author":"C Dehnert","year":"2017","unstructured":"Dehnert, C., Junges, S., Katoen, J.-P., Volk, M.: A storm is coming: a modern probabilistic model checker. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10427, pp. 592\u2013600. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63390-9_31"},{"issue":"4","key":"20_CR26","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1109\/TKDE.2000.868901","volume":"12","author":"MJ Druzdzel","year":"2000","unstructured":"Druzdzel, M.J., van der Gaag, L.C.: Building probabilistic networks: \u201cwhere do the numbers come from?\u2019\u2019. IEEE Trans. Knowl. Data Eng. 12(4), 481\u2013486 (2000)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"20_CR27","doi-asserted-by":"crossref","unstructured":"Fang, X., Calinescu, R., Gerasimou, S., Alhwikem, F.: Fast parametric model checking through model fragmentation. In: ICSE, pp. 835\u2013846. IEEE (2021)","DOI":"10.1109\/ICSE43902.2021.00081"},{"key":"20_CR28","doi-asserted-by":"crossref","unstructured":"Fang, X., Calinescu, R., Gerasimou, S., Alhwikem, F.: Fast parametric model checking through model fragmentation. CoRR https:\/\/arxiv.org\/abs\/2102.01490 (2021)","DOI":"10.1109\/ICSE43902.2021.00081"},{"key":"20_CR29","series-title":"Studies in Fuzziness and Soft Computing","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-540-68996-6_5","volume-title":"Advances in Probabilistic Graphical Models","author":"LC van der Gaag","year":"2007","unstructured":"van der Gaag, L.C., Renooij, S., Coup\u00e9, V.M.H.: Sensitivity analysis of probabilistic networks. In: Lucas, P., G\u00e1mez, J.A., Salmer\u00f3n, A. (eds.) Advances in Probabilistic Graphical Models. SFSC, vol. 213, pp. 103\u2013124. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-68996-6_5"},{"key":"20_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/978-3-030-01090-4_18","volume-title":"Automated Technology for Verification and Analysis","author":"P Gainer","year":"2018","unstructured":"Gainer, P., Hahn, E.M., Schewe, S.: Accelerated model checking of parametric markov chains. In: Lahiri, S.K., Wang, C. (eds.) ATVA 2018. LNCS, vol. 11138, pp. 300\u2013316. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-01090-4_18"},{"issue":"1","key":"20_CR31","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10009-010-0146-x","volume":"13","author":"EM Hahn","year":"2011","unstructured":"Hahn, E.M., Hermanns, H., Zhang, L.: Probabilistic reachability for parametric Markov models. Int. J. Softw. Tools Technol. Transf. 13(1), 3\u201319 (2011)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"issue":"1\u20134","key":"20_CR32","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1023\/A:1016713501153","volume":"32","author":"M Jaeger","year":"2001","unstructured":"Jaeger, M.: Complex probabilistic modeling with recursive relational Bayesian networks. Ann. Math. Artif. Intell. 32(1\u20134), 179\u2013220 (2001)","journal-title":"Ann. Math. Artif. Intell."},{"key":"20_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/978-3-319-10696-0_31","volume-title":"Quantitative Evaluation of Systems","author":"N Jansen","year":"2014","unstructured":"Jansen, N., et al.: Accelerating parametric probabilistic verification. In: Norman, G., Sanders, W. (eds.) QEST 2014. LNCS, vol. 8657, pp. 404\u2013420. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10696-0_31"},{"key":"20_CR34","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-48747-6_18","volume-title":"Symbolic and Quantitative Approaches to Reasoning and Uncertainty","author":"FV Jensen","year":"1999","unstructured":"Jensen, F.V.: Gradient descent training of Bayesian networks. In: Hunter, A., Parsons, S. (eds.) ECSQARU 1999. LNCS (LNAI), vol. 1638, pp. 190\u2013200. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48747-6_18"},{"key":"20_CR35","unstructured":"Junges, S., et al.: Parameter synthesis for Markov models. CoRR https:\/\/arxiv.org\/abs\/1903.07993 (2019)"},{"key":"20_CR36","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.jcss.2021.02.006","volume":"119","author":"S Junges","year":"2021","unstructured":"Junges, S., Katoen, J.P., P\u00e9rez, G.A., Winkler, T.: The complexity of reachability in parametric Markov decision processes. J. Comput. Syst. Sci. 119, 183\u2013210 (2021)","journal-title":"J. Comput. Syst. Sci."},{"key":"20_CR37","unstructured":"Kj\u00e6rulff, U., van der Gaag, L.C.: Making sensitivity analysis computationally efficient. In: UAI, pp. 317\u2013325. Morgan Kaufmann (2000)"},{"key":"20_CR38","unstructured":"Kwisthout, J., van der Gaag, L.C.: The computational complexity of sensitivity analysis and parameter tuning. In: UAI, pp. 349\u2013356. AUAI Press (2008)"},{"issue":"1","key":"20_CR39","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s00165-006-0015-2","volume":"19","author":"R Lanotte","year":"2007","unstructured":"Lanotte, R., Maggiolo-Schettini, A., Troina, A.: Parametric probabilistic transition systems for system design and analysis. Formal Aspects Comput. 19(1), 93\u2013109 (2007)","journal-title":"Formal Aspects Comput."},{"issue":"6","key":"20_CR40","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1109\/21.384252","volume":"25","author":"KB Laskey","year":"1995","unstructured":"Laskey, K.B.: Sensitivity analysis for probability assessments in Bayesian networks. IEEE Trans. Syst. Man Cybern. 25(6), 901\u2013909 (1995)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"20_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-319-46520-3_4","volume-title":"Automated Technology for Verification and Analysis","author":"T Quatmann","year":"2016","unstructured":"Quatmann, T., Dehnert, C., Jansen, N., Junges, S., Katoen, J.-P.: Parameter synthesis for Markov models: faster than ever. In: Artho, C., Legay, A., Peled, D. (eds.) ATVA 2016. LNCS, vol. 9938, pp. 50\u201367. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46520-3_4"},{"issue":"4","key":"20_CR42","doi-asserted-by":"publisher","first-page":"1022","DOI":"10.1016\/j.ijar.2013.07.004","volume":"55","author":"S Renooij","year":"2014","unstructured":"Renooij, S.: Co-variation for sensitivity analysis in Bayesian networks: properties, consequences and alternatives. Int. J. Approx. Reason. 55(4), 1022\u20131042 (2014)","journal-title":"Int. J. Approx. Reason."},{"key":"20_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-030-59854-9_9","volume-title":"Quantitative Evaluation of Systems","author":"B Salmani","year":"2020","unstructured":"Salmani, B., Katoen, J.-P.: Bayesian inference by symbolic model checking. In: Gribaudo, M., Jansen, D.N., Remke, A. (eds.) QEST 2020. LNCS, vol. 12289, pp. 115\u2013133. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59854-9_9"},{"key":"20_CR44","doi-asserted-by":"crossref","unstructured":"Salmani, B., Katoen, J.: Fine-tuning the odds in Bayesian networks. CoRR https:\/\/arxiv.org\/abs\/2105.14371 (2021)","DOI":"10.1007\/978-3-030-86772-0_20"},{"key":"20_CR45","unstructured":"Scutari, M.: Bayesian network repository. https:\/\/www.bnlearn.com. Accessed 2019"},{"key":"20_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/978-3-030-31784-3_28","volume-title":"Automated Technology for Verification and Analysis","author":"J Spel","year":"2019","unstructured":"Spel, J., Junges, S., Katoen, J.-P.: Are parametric Markov chains monotonic? In: Chen, Y.-F., Cheng, C.-H., Esparza, J. (eds.) ATVA 2019. LNCS, vol. 11781, pp. 479\u2013496. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31784-3_28"},{"key":"20_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-030-72016-2_10","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J Spel","year":"2021","unstructured":"Spel, J., Junges, S., Katoen, J.-P.: Finding provably optimal Markov chains. In: TACAS 2021. LNCS, vol. 12651, pp. 173\u2013190. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-72016-2_10"},{"key":"20_CR48","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.advengsoft.2017.09.003","volume":"115","author":"S Tolo","year":"2018","unstructured":"Tolo, S., Patelli, E., Beer, M.: An open toolbox for the reduction, inference computation and sensitivity analysis of Credal networks. Adv. Eng. Softw. 115, 126\u2013148 (2018)","journal-title":"Adv. Eng. Softw."}],"container-title":["Lecture Notes in Computer Science","Symbolic and Quantitative Approaches to Reasoning with Uncertainty"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86772-0_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T10:08:14Z","timestamp":1635761294000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86772-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030867713","9783030867720"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86772-0_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"19 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECSQARU","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Symbolic and Quantitative Approaches with Uncertainty","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","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":"21 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecsqaru2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ecsqaru.utia.cas.cz\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"63","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"76% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.95","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.25","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}