{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T18:10:14Z","timestamp":1762625414618,"version":"3.37.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319944593"},{"type":"electronic","value":"9783319944609"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-94460-9_10","type":"book-chapter","created":{"date-parts":[[2018,7,9]],"date-time":"2018-07-09T11:36:38Z","timestamp":1531136198000},"page":"164-179","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Confluence and Convergence in\u00a0Probabilistically Terminating Reduction\u00a0Systems"],"prefix":"10.1007","author":[{"given":"Maja H.","family":"Kirkeby","sequence":"first","affiliation":[]},{"given":"Henning","family":"Christiansen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,10]]},"reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/BFb0017444","volume-title":"Principles and Practice of Constraint Programming-CP97","author":"S Abdennadher","year":"1997","unstructured":"Abdennadher, S.: Operational semantics and confluence of constraint propagation rules. In: Smolka, G. (ed.) CP 1997. LNCS, vol. 1330, pp. 252\u2013266. Springer, Heidelberg (1997). \nhttps:\/\/doi.org\/10.1007\/BFb0017444"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-61551-2_62","volume-title":"Principles and Practice of Constraint Programming \u2014 CP 1996","author":"S Abdennadher","year":"1996","unstructured":"Abdennadher, S., Fr\u00fchwirth, T., Meuss, H.: On confluence of constraint handling rules. In: Freuder, E.C. (ed.) CP 1996. LNCS, vol. 1118, pp. 1\u201315. Springer, Heidelberg (1996). \nhttps:\/\/doi.org\/10.1007\/3-540-61551-2_62"},{"key":"10_CR3","volume-title":"Term Rewriting and All That","author":"F Baader","year":"1999","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1999)"},{"key":"10_CR4","unstructured":"Babai, L.: Monte-Carlo algorithms in graph isomorphism testing. Universit\u00e9 de Montr\u00e9al Technical report, DMS, vol. 79, pp. 1\u201333 (1979)"},{"key":"10_CR5","unstructured":"Baier, C., Katoen, J.-P.: Principles of Model Checking, vol. 950. MIT Press (2008)"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/11805618_27","volume-title":"Term Rewriting and Applications","author":"O Bournez","year":"2006","unstructured":"Bournez, O., Garnier, F.: Proving positive almost sure termination under strategies. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol. 4098, pp. 357\u2013371. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11805618_27"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/3-540-45610-4_18","volume-title":"Rewriting Techniques and Applications","author":"O Bournez","year":"2002","unstructured":"Bournez, O., Kirchner, C.: Probabilistic rewrite strategies. applications to ELAN. In: Tison, S. (ed.) RTA 2002. LNCS, vol. 2378, pp. 252\u2013266. Springer, Heidelberg (2002). \nhttps:\/\/doi.org\/10.1007\/3-540-45610-4_18"},{"issue":"1","key":"10_CR8","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s00165-016-0396-9","volume":"29","author":"H Christiansen","year":"2017","unstructured":"Christiansen, H., Kirkeby, M.H.: On proving confluence modulo equivalence for Constraint Handling Rules. Formal Aspects Comput. 29(1), 57\u201395 (2017)","journal-title":"Formal Aspects Comput."},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/3-540-53904-2_98","volume-title":"Rewriting Techniques and Applications","author":"Pierre-Louis Curien","year":"1991","unstructured":"Curien, P.-L., Ghelli, G.: On confluence for weakly normalizing systems. In: RTA-1991, pp. 215\u2013225 (1991)"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Fioriti, L.M.F., Hermanns, H.: Probabilistic termination: soundness, completeness, and compositionality. In: POPL 2015, pp. 489\u2013501 (2015)","DOI":"10.1145\/2676726.2677001"},{"issue":"3","key":"10_CR11","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1145\/321592.321600","volume":"17","author":"W Donald Frazer","year":"1970","unstructured":"Donald Frazer, W., McKellar, A.C.: Samplesort: a sampling approach to minimal storage tree sorting. J. ACM 17(3), 496\u2013507 (1970)","journal-title":"J. ACM"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S1571-0661(04)80789-8","volume":"76","author":"TW Fr\u00fchwirth","year":"2002","unstructured":"Fr\u00fchwirth, T.W., Di Pierro, A., Wiklicky, H.: Probabilistic constraint handling rules. Electr. Notes Theor. Comput. Sci. 76, 115\u2013130 (2002)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"issue":"3","key":"10_CR13","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1145\/2166.357214","volume":"5","author":"S Hart","year":"1983","unstructured":"Hart, S., Sharir, M., Pnueli, A.: Termination of probabilistic concurrent program. ACM Trans. Program. Lang. Syst. 5(3), 356\u2013380 (1983)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"2","key":"10_CR14","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0020-0190(90)90107-9","volume":"35","author":"T Herman","year":"1990","unstructured":"Herman, T.: Probabilistic self-stabilization. Inf. Process. Letters 35(2), 63\u201367 (1990)","journal-title":"Inf. Process. Letters"},{"issue":"1","key":"10_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2272337","volume":"39","author":"J Roger Hindley","year":"1974","unstructured":"Roger Hindley, J.: An abstract Church-Rosser theorem. II: applications. J. Symb. Log. 39(1), 1\u201321 (1974)","journal-title":"J. Symb. Log."},{"issue":"4","key":"10_CR16","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"GP Huet","year":"1980","unstructured":"Huet, G.P.: Confluent reductions: abstract properties and applications to term rewriting systems: Abstract properties and applications to term rewriting systems. J. ACM 27(4), 797\u2013821 (1980)","journal-title":"J. ACM"},{"issue":"3","key":"10_CR17","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/0020-0190(79)90051-6","volume":"9","author":"A Itai","year":"1979","unstructured":"Itai, A.: A randomized algorithm for checking equivalence of circular lists. Inf. Process. Lett. 9(3), 118\u2013121 (1979)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"10_CR18","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1145\/234533.234534","volume":"43","author":"DR Karger","year":"1996","unstructured":"Karger, D.R., Stein, C.: A new approach to the minimum cut problem. J. ACM 43(4), 601\u2013640 (1996)","journal-title":"J. ACM"},{"issue":"4598","key":"10_CR19","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt Jr., D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"issue":"3","key":"10_CR20","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF01874396","volume":"1","author":"E Maffioli","year":"1984","unstructured":"Maffioli, E., Speranza, M.G., Vercellis, C.: Randomized algorithms: an annotated bibliography. Ann. Oper. Res. 1(3), 331\u2013345 (1984)","journal-title":"Ann. Oper. Res."},{"key":"10_CR21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, New York (1995)"},{"issue":"2","key":"10_CR22","doi-asserted-by":"publisher","first-page":"223","DOI":"10.2307\/1968867","volume":"43","author":"MHA Newman","year":"1942","unstructured":"Newman, M.H.A.: On theories with a combinatorial definition of \u201cequivalence\u201d. Ann. Math. 43(2), 223\u2013243 (1942)","journal-title":"Ann. Math."},{"issue":"2","key":"10_CR23","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BF00288965","volume":"17","author":"MO Rabin","year":"1982","unstructured":"Rabin, M.O.: The choice coordination problem. Acta Informatica 17(2), 121\u2013134 (1982)","journal-title":"Acta Informatica"},{"key":"10_CR24","first-page":"715","volume":"1995","author":"T Sato","year":"1995","unstructured":"Sato, T.: A statistical learning method for logic programs with distribution semantics. ICLP 1995, 715\u2013729 (1995)","journal-title":"ICLP"},{"issue":"2","key":"10_CR25","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s10844-008-0062-7","volume":"31","author":"T Sato","year":"2008","unstructured":"Sato, T.: A glimpse of symbolic-statistical modeling by PRISM. J. Intell. Inf. Syst. 31(2), 161\u2013176 (2008)","journal-title":"J. Intell. Inf. Syst."},{"issue":"6","key":"10_CR26","first-page":"909","volume":"14","author":"T Sato","year":"2014","unstructured":"Sato, T., Meyer, P.J.: Infinite probability computation by cyclic explanation graphs. TPLP 14(6), 909\u2013937 (2014)","journal-title":"TPLP"},{"issue":"4-6","key":"10_CR27","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1017\/S1471068410000207","volume":"10","author":"JON SNEYERS","year":"2010","unstructured":"Sneyers, J., Meert, W., Vennekens, J., Kameya, Y., Sato, T.: CHR(PRISM)-based probabilistic logic learning. In: TPLP, vol. 10(4\u20136) (2010)","journal-title":"Theory and Practice of Logic Programming"},{"key":"10_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-642-32211-2_15","volume-title":"Logic-Based Program Synthesis and Transformation","author":"J Sneyers","year":"2012","unstructured":"Sneyers, J., De Schreye, D.: Probabilistic termination of CHRiSM programs. In: Vidal, G. (ed.) LOPSTR 2011. LNCS, vol. 7225, pp. 221\u2013236. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-32211-2_15"},{"key":"10_CR29","unstructured":"Weisstein, E.W.: q-Pochhammer Symbol. MathWorld - A Wolfram Web Resource (2017)"},{"key":"10_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/3-540-09519-5_73","volume-title":"Symbolic and Algebraic Computation","author":"R Zippel","year":"1979","unstructured":"Zippel, R.: Probabilistic algorithms for sparse polynomials. In: Ng, E.W. (ed.) Symbolic and Algebraic Computation. LNCS, vol. 72, pp. 216\u2013226. Springer, Heidelberg (1979). \nhttps:\/\/doi.org\/10.1007\/3-540-09519-5_73"}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94460-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,7,9]],"date-time":"2018-07-09T11:43:32Z","timestamp":1531136612000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-94460-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319944593","9783319944609"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94460-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}