Probabilistic rewrite strategies. Applications to ELAN

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2378, Issue , 2002, Pages 252-266

  Bournez, Olivier ^a   Kirchner, Claude ^a  

^a LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ABSTRACT REDUCTION; MODELING TOOL; PROBABILISTIC CHOICES; RANDOMIZED SYSTEMS; REWRITE STRATEGIES; RULE APPLICATION; RULE-BASED LANGUAGE; STRATEGY LANGUAGES;

MODELING LANGUAGES;

EID: 84947275431     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45610-4_18     Document Type: Conference Paper

References (21)

1. D. Abdemouche. Stratégies probabilistes en elan et applications.M émoire de dea en informatique, Université Henri Poincaré – Nancy 1, July 2001.
2. F. Baader and T. Nipkow. Term Rewriting and all That. Cam bridge University Press, 1998.
3. P. Borovanský, C.Kirc hner, H.Kirc hner, and C. Ringeissen. Rewriting with strategies in ELAN: a functional semantics. International Journal of Foundations of Computer Science, 12(1):69–98, February 2001.
4. P. Brémaud. Markov Chains. Springer, 1991.
5. 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.
6. 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.
7. W. Feller. An introduction to probability theory and its applications, volume 1 and 2.Wiley, 1968.
8. T. Frühwirth, A. Di Pierro, and H. Wiklic ky. Toward probabilistic constraint handling rules. In S. Ab dennadher and T.F rü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.
9. D. E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-W esley, Reading, Massachusetts, 1989.
10. G. Grimmett. Probability Theory. Cam bridge University Press, 1993.
11. H. Kirc hner 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.
12. J. W. Klop. Term rewriting systems. In S. Abramsky, D. M. Gabba y, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume 2, chapter 1, pages 1–117.Oxford University Press, Oxford, 1992.
13. D. E. Knuth. The art of Computer Programming, volume 2.Addison-W esley Publishing Company, second edition, 1981.
14. P. Lincoln, J. Mitchell, and A. Scedrov. Stochastic interaction and linear logic. In J.-Y. Girard, Y. Lafon t, and L. Regnier, editors, Advances in Linear Logic, pages 147–166.V olume 222, London Mathematical Society Lecture Notes, Cambridge University Press, 1995.
15. R. Motwani and P. Ragha van. Randomized Algorithms. Cam bridge University Press, 1995.
16. 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.
17. D. Pierro and Wiklicky A markov model for probabilistic concurrent constraint programming. In APPIA-GULP-PRODE’98, Joint Conference on Declarative Programming, 1998.
18. D. Pierro and Wiklicky. Probabilistic concurrent constraint programming: Towards a fully abstract model. In MFCS: Symposium on Mathematical Foundations of Computer Science, 1998.
19. 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.
20. W. Rudin. Real and Complex Analysis, 3rd edition.McGra w Hills, USA, March 1987.
21. V. Subrahmanian. Probabilistic databases and logic programming. In International Conference on Logic Programming, volume 2237 of Lecture Notes in Computer Science, page 10.Springer-V erlag, 2001.