Download:
|
by Alessandra Di Pierro, Herbert Wiklicky
Proc. of the ERCIM/Compulog Workshop on Constraints
http://www.di.unipi.it/~dipierro/papers/ERCIM00.ps
Add To MetaCart
Abstract:
Abstract. We propose a declarative implementation of randomised algorithms, which exploits the Constraint Logic Programming (CLP) paradigm. For the high-level formalisation of probabilistic programs expressing such algorithms we actually refer to a generalisation of CLP, namely the Probabilistic Concurrent Constraint Programming (PCCP) language, previously introduced in [3, 5]. This language provides a construct for probabilistic choice which allows us to express randomness in a program. The design of PCCP does not require any additional structure on the underlying constraint system (e.g. fuzzy or belief systems) and therefore also allows a straight forward implementation. We demonstrate the use of this language for implementing randomised algorithms. In particular, we give an extensive treatment of two popular (generic) randomised algorithms, namely Simulated Annealing and Randomised Rounding, and we discuss some instantiations of these algorithms for solving two well-known optimisation problems, namely the travelling salesman (TSP) and the maximum satisfaction (MAX SAT) problem. 1
Citations
|
2172
|
Optimization by simulated annealing
– Kirkpatrick, Gelatt, et al.
- 1983
|
|
1120
|
Equation of state calculations by fast computing machines
– Metropolis, Rosenbluth, et al.
- 1953
|
|
574
|
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
– Goemans, Williamson
- 1995
|
|
409
|
Approximation Algorithms for NP-hard Problems
– Hochbaum
- 1997
|
|
408
|
Concurrent constraint programming
– Saraswat
- 1993
|
|
245
|
Semantics foundations of concurrent constraint programming
– Saraswat, Rinard, et al.
- 1991
|
|
173
|
Simulated Annealing and Boltzmann Machines: a stochastic approach to combinatorial optimization and neural computing
– Aarts, Korst
- 1989
|
|
87
|
Semantics of probabilistic programs
– Kozen
- 1981
|
|
86
|
Semiring-based constraint satisfaction and optimization
– Bistarelli, Montanari, et al.
- 1997
|
|
63
|
New 3/4-approximation algorithms for the maximum satisfiability problem
– Goemans, Williamson
- 1994
|
|
30
|
An operational semantics for Probabilistic Concurrent Constraint Programming
– Pierro, Wiklicky
- 1998
|
|
22
|
Probabilistic concurrent constraint programming
– Gupta, Jagadeesan
- 1997
|
|
9
|
On probabilistic CCP
– Pierro, Wiklicky
- 1997
|
|
8
|
A banach space based semantics for probabilistic concurrent constraint programming
– Pierro, Wiklicky
- 1998
|
|
4
|
Advanced algorithms
– Goemans
- 1994
|
|
3
|
Quantitative observables and averages
– Pierro, Wiklicky
- 2000
|
