Logics for probabilistic programming
Publication
, Journal Article
Reif, JH
Published in: Proceedings of the Annual ACM Symposium on Theory of Computing
April 28, 1980
This paper introduces a logic for probabilistic programming+ PROB-DL (for probabilistic dynamic logic; see Section 2 for a formal definition). This logic has "dynamic" modal operators in which programs appear, as in Pratt's [1976] dynamic logic DL. However the programs of PROB-DL contain constructs for probabilistic branching and looping whereas DL is restricted to nondeterministic programs. The formula {a}σp of PROB-DL denotes "with measure ≥σ, formula p holds after executing program a."
Duke Scholars
Published In
Proceedings of the Annual ACM Symposium on Theory of Computing
DOI
ISSN
0737-8017
Publication Date
April 28, 1980
Volume
1980-April
Start / End Page
8 / 13
Citation
APA
Chicago
ICMJE
MLA
NLM
Reif, J. H. (1980). Logics for probabilistic programming. Proceedings of the Annual ACM Symposium on Theory of Computing, 1980-April, 8–13. https://doi.org/10.1145/800141.804647
Reif, J. H. “Logics for probabilistic programming.” Proceedings of the Annual ACM Symposium on Theory of Computing 1980-April (April 28, 1980): 8–13. https://doi.org/10.1145/800141.804647.
Reif JH. Logics for probabilistic programming. Proceedings of the Annual ACM Symposium on Theory of Computing. 1980 Apr 28;1980-April:8–13.
Reif, J. H. “Logics for probabilistic programming.” Proceedings of the Annual ACM Symposium on Theory of Computing, vol. 1980-April, Apr. 1980, pp. 8–13. Scopus, doi:10.1145/800141.804647.
Reif JH. Logics for probabilistic programming. Proceedings of the Annual ACM Symposium on Theory of Computing. 1980 Apr 28;1980-April:8–13.
Published In
Proceedings of the Annual ACM Symposium on Theory of Computing
DOI
ISSN
0737-8017
Publication Date
April 28, 1980
Volume
1980-April
Start / End Page
8 / 13