{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T17:31:29Z","timestamp":1762623089129},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540439165"},{"type":"electronic","value":"9783540456100"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45610-4_18","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T02:47:11Z","timestamp":1186886831000},"page":"252-266","source":"Crossref","is-referenced-by-count":19,"title":["Probabilistic Rewrite Strategies. Applications to ELAN"],"prefix":"10.1007","author":[{"given":"Olivier","family":"Bournez","sequence":"first","affiliation":[]},{"given":"Claude","family":"Kirchner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,7,9]]},"reference":[{"key":"18_CR1","unstructured":"D. Abdemouche. Strat\u00e9gies probabilistes en elan et applications. M\u00e9moire de dea en informatique, Universit\u00e9 Henri Poincar\u00e9-Nancy 1, July 2001."},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"F. Baader and T. Nipkow. Term Rewriting and all That. Cambridge University Press, 1998.","DOI":"10.1017\/CBO9781139172752"},{"issue":"1","key":"18_CR3","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1142\/S0129054101000412","volume":"12","author":"P. Borovansk\u00fd","year":"2001","unstructured":"P. Borovansk\u00fd, C. Kirchner, H. Kirchner, and C. Ringeissen. Rewriting with strategies in ELAN: a functional semantics. International Journal of Foundations of Computer Science, 12(1):69\u201398, February 2001.","journal-title":"International Journal of Foundations of Computer Science"},{"key":"18_CR4","unstructured":"P. Br\u00e9maud. Markov Chains. Springer, 1991."},{"issue":"3","key":"18_CR5","first-page":"427","volume":"9","author":"H. Cirstea","year":"2001","unstructured":"H. Cirstea and C. Kirchner. The rewriting calculus \u2014Part I and II. Logic Journal of the Interest Group in Pure and Applied Logics, 9(3):427\u2013498, May 2001.","journal-title":"Logic Journal of the Interest Group in Pure and Applied Logics"},{"key":"18_CR6","unstructured":"A. Dutech, O. Buffet, and F. Charpillet. Multi-Agent Systems by Incremental Gradient Reinforcement Learning. In 17th International Joint Conference on Artificial Intelligence, Seattle, WA, USA, volume 2, pages 833\u2013838, August 2001."},{"key":"18_CR7","unstructured":"W. Feller. An introduction to probability theory and its applications, volume 1 and 2. Wiley, 1968."},{"key":"18_CR8","unstructured":"T. Fr\u00fchwirth, A. Di Pierro, and H. Wiklicky. Toward probabilistic constraint handling rules. In S. Abdennadher and T. Fr\u00fchwirth, editors, Proceedings of the third Workshop on Rule-Based Constraint Reasoning and Programming (RCoRP\u201901), Paphos, Cyprus, December 2001. Under the hospice of the International Conferences in Constraint Programming and Logic Programming."},{"key":"18_CR9","volume-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"D. E. Goldberg","year":"1989","unstructured":"D. E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, Massachusetts, 1989."},{"key":"18_CR10","unstructured":"G. Grimmett. Probability Theory. Cambridge University Press, 1993."},{"issue":"2","key":"18_CR11","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1017\/S0956796800003907","volume":"11","author":"H. Kirchner","year":"2001","unstructured":"H. Kirchner and P.-E. Moreau. Promoting rewriting to a programming language: A compiler for non-deterministic rewrite programs in associative-commutative theories. Journal of Functional Programming, 11(2):207\u2013251, 2001.","journal-title":"Journal of Functional Programming"},{"key":"18_CR12","first-page":"1","volume-title":"Handbook of Logic in Computer Science","author":"J. W. Klop","year":"1992","unstructured":"J. W. Klop. Term rewriting systems. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume 2, chapter 1, pages 1\u2013117. Oxford University Press, Oxford, 1992."},{"key":"18_CR13","unstructured":"D. E. Knuth. The art of Computer Programming, volume 2. Addison-Wesley Publishing Company, second edition, 1981."},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"P. Lincoln, J. Mitchell, and A. Scedrov. Stochastic interaction and linear logic. In J.-Y. Girard, Y. Lafont, and L. Regnier, editors, Advances in Linear Logic, pages 147\u2013166. Volume 222, London Mathematical Society Lecture Notes, Cambridge University Press, 1995.","DOI":"10.1017\/CBO9780511629150.008"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.","DOI":"10.1017\/CBO9780511814075"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"A. D. Pierro and H. Wiklicky. An operational semantics for probabilistic concurrent constraint programming. In Proceedings of the 1998 International Conference on Computer Languages, pages 174\u2013183. IEEE Computer Society Press, 1998.","DOI":"10.1109\/ICCL.1998.674168"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"D. Pierro and Wiklicky. A markov model for probabilistic concurrent constraint programming. In APPIA-GULP-PRODE\u201998, Joint Conference on Declarative Programming, 1998.","DOI":"10.1007\/BFb0055794"},{"key":"18_CR18","unstructured":"D. Pierro and Wiklicky. Probabilistic concurrent constraint programming: Towards a fully abstract model. In MFCS: Symposium on Mathematical Foundations of Computer Science, 1998."},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"D. Pierro and Wiklicky. Concurrent constraint programming: Towards probabilistic abstract interpretation. In 2nd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP\u201900), 2000.","DOI":"10.1145\/351268.351284"},{"key":"18_CR20","volume-title":"Real and Complex Analysis","author":"W. Rudin","year":"1987","unstructured":"W. Rudin. Real and Complex Analysis, 3rd edition. McGraw Hills, USA, March 1987.","edition":"3rd edition"},{"key":"18_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/3-540-45635-X_8","volume-title":"International Conference on Logic Programming","author":"V. Subrahmanian","year":"2001","unstructured":"V. Subrahmanian. Probabilistic databases and logic programming. In International Conference on Logic Programming, volume 2237 of Lecture Notes in Computer Science, page 10. Springer-Verlag, 2001."}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45610-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,21]],"date-time":"2021-08-21T12:35:31Z","timestamp":1629549331000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45610-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540439165","9783540456100"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-45610-4_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}