Abstract
Recently rule based languages focussed on the use of rewriting as a modeling tool which results in making specifications executable. To extend the modeling capabilities of rule based languages, we explore the possibility of making the rule applications subject to probabilistic choices.
We propose an extension of the ELAN strategy language to deal with randomized systems. We argue through several examples that we propose indeed a natural setting to model systems with randomized choices. This leads us to interesting new problems, and we address the generalization of the usual concepts in abstract reduction systems to randomized systems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Abdemouche. Stratégies probabilistes en elan et applications. Mémoire de dea en informatique, Université Henri Poincaré-Nancy 1, July 2001.
F. Baader and T. Nipkow. Term Rewriting and all That. Cambridge University Press, 1998.
P. Borovanský, 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–98, February 2001.
P. Brémaud. Markov Chains. Springer, 1991.
H. Cirstea and C. Kirchner. The rewriting calculus —Part I and II. Logic Journal of the Interest Group in Pure and Applied Logics, 9(3):427–498, May 2001.
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–838, August 2001.
W. Feller. An introduction to probability theory and its applications, volume 1 and 2. Wiley, 1968.
T. Frühwirth, A. Di Pierro, and H. Wiklicky. Toward probabilistic constraint handling rules. In S. Abdennadher and T. Frühwirth, editors, Proceedings of the third Workshop on Rule-Based Constraint Reasoning and Programming (RCoRP’01), Paphos, Cyprus, December 2001. Under the hospice of the International Conferences in Constraint Programming and Logic Programming.
D. E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, Massachusetts, 1989.
G. Grimmett. Probability Theory. Cambridge University Press, 1993.
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–251, 2001.
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–117. Oxford University Press, Oxford, 1992.
D. E. Knuth. The art of Computer Programming, volume 2. Addison-Wesley Publishing Company, second edition, 1981.
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–166. Volume 222, London Mathematical Society Lecture Notes, Cambridge University Press, 1995.
R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
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–183. IEEE Computer Society Press, 1998.
D. Pierro and Wiklicky. A markov model for probabilistic concurrent constraint programming. In APPIA-GULP-PRODE’98, Joint Conference on Declarative Programming, 1998.
D. Pierro and Wiklicky. Probabilistic concurrent constraint programming: Towards a fully abstract model. In MFCS: Symposium on Mathematical Foundations of Computer Science, 1998.
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’00), 2000.
W. Rudin. Real and Complex Analysis, 3rd edition. McGraw Hills, USA, March 1987.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bournez, O., Kirchner, C. (2002). Probabilistic Rewrite Strategies. Applications to ELAN. In: Tison, S. (eds) Rewriting Techniques and Applications. RTA 2002. Lecture Notes in Computer Science, vol 2378. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45610-4_18
Download citation
DOI: https://doi.org/10.1007/3-540-45610-4_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43916-5
Online ISBN: 978-3-540-45610-0
eBook Packages: Springer Book Archive