Real and complex analysis, 3rd ed.
Real and complex analysis, 3rd ed.
Handbook of logic in computer science (vol. 2)
Randomized algorithms
Stochastic interaction and linear logic
Proceedings of the workshop on Advances in linear logic
Term rewriting and all that
Concurrent constraint programming: towards probabilistic abstract interpretation
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Probabilistic Databases and Logic Programming
Proceedings of the 17th International Conference on Logic Programming
Probabilistic Concurrent Constraint Programming: Towards a Fully Abstract Model
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
An Operational Semantics for Probabilistic Concurrent Constraint Programming
ICCL '98 Proceedings of the 1998 International Conference on Computer Languages
Journal of Functional Programming
Multi-agent systems by incremental gradient reinforcement learning
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
A Generalization of Equational Proof Theory?
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Induction for positive almost sure termination
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
An Abstract Way to Define Rewriting Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Rewriting logic and probabilities
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Attenuation regulation as a term rewriting system
AB'07 Proceedings of the 2nd international conference on Algebraic biology
Confluence Results for a Quantum Lambda Calculus with Measurements
Electronic Notes in Theoretical Computer Science (ENTCS)
Proving positive almost-sure termination
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Proving positive almost sure termination under strategies
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Probabilistic termination of CHRiSM programs
LOPSTR'11 Proceedings of the 21st international conference on Logic-Based Program Synthesis and Transformation
| Hi-index | 0.00 |
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.