Computing Publications

Publications Home » Probabilistic constraint handling rules

Probabilistic constraint handling rules

Thom , Alessandra Di Pierro, Herbert Wiklicky

Conference or Workshop Paper
WFLP 2002, 11th International Workshop on Functional and (Constraint) Logic Programming
November, 2002
Electronic Notes in Theoretical Computer Science
Volume 76
pp.1–16
Elsevier
ISSN 1571-0661
DOI 10.1016/S1571-0661(04)80789-8
Abstract

Classical previous termConstraint Handling Rulesnext term (CHR) provide a powerful tool for specifying and implementing previous termconstraintnext term solvers and programs. The previous termrulesnext term of CHR rewrite previous termconstraintsnext term (non-deterministically) into simpler ones until they are solved.

In this paper we introduce an extension of previous termConstraint Handling Rulesnext term (CHR), namely previous termProbabilisticnext term CHRs (PCHR). These allow the previous termprobabilisticnext term "weighting" of previous termrules,next term specifying the probability of their application. In this way we are able to formalise various randomised algorithms such as for example Simulated Annealing.

The implementation is based on source-to-source transformation (STS). Using a recently developed prototype for STS for CHR, we could implement previous termprobabilisticnext term CHR in a concise way with a few lines of code in less than one hour.

GZipped Postscript of full publication (89 kilobytes)
(need help viewing GZipped Postscript files?)
BibTEX file for the publication
N.B.
Conditions for downloading publications from this site.
 

pubs.doc.ic.ac.uk: built & maintained by Ashok Argent-Katwala.