PADO '01 Proceedings of the Second Symposium on Programs as Data Objects
Quantitative Observables and Averages in Probabilistic Constraint Programming
Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
Measuring the Precision of Abstract Interpretations
LOPSTR '00 Selected Papers form the 10th International Workshop on Logic Based Program Synthesis and Transformation
Analysing Approximate Confinement under Uniform Attacks
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Probabilistic Rewrite Strategies. Applications to ELAN
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Model-Based Programming: Controlling Embedded Systems by Reasoning About Hidden State
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Prioritised fuzzy constraint satisfaction problems: axioms, instantiation and validation
Fuzzy Sets and Systems - Theme: Multicriteria decision
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
Algebraic Power Analysis by Abstract Interpretation
Higher-Order and Symbolic Computation
Induction for positive almost sure termination
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Non-determinism and Probabilities in Timed Concurrent Constraint Programming
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Stochastic Programs and Hybrid Automata for (Biological) Modeling
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
Rewriting logic and probabilities
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
A 25-year perspective on logic programming
Concurrent and reactive constraint programming
A 25-year perspective on logic programming
A distributed and probabilistic concurrent constraint programming language
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Measuring the speed of information leakage in mobile processes
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
| Hi-index | 0.00 |
This paper investigates a probabilistic version of the concurrent constraint programming paradigm (CCP). The aim is to introduce the possibility to formulate so called ``randomised algorithms'' within the CCP framework. Differently from common approaches in (imperative) high-level programming languages, which rely on some kind of `random()' function, we introduce randomness in the very definition of the language by means of a probabilistic choice construct. This allows a program to make stochastic moves during its execution. We call the resulting language Probabilistic Concurrent Constraint Programming (PCCP). We present an operational semantics for PCCP by means of a probabilistic transition system such that the execution of a PCCP program may be seen as a stochastic process, i.e. as a random walk on the transition graph. The transition probabilities are given explicitly. This semantics captures a notion of observables which combines results of computations and the probability of those results being computed. This embedding of randomness within the semantics of a well structured programming paradigm, like CCP, also aims at providing a sound framework for formalising and reasoning about randomised algorithms and programs. Additionally, we give some examples of PCCP programs and we show how well-known randomised algorithms can be implemented very naturally in the new language.