Home ›
Entities
› academia
› Guaranteed bounds for posterior inference in universal probabilistic programming
Guaranteed bounds for posterior inference in universal probabilistic programming
Research article (Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2022) · cited 18× · AI/ML
Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.
APA4ort.xyz Knowledge Graph. (2026). Guaranteed bounds for posterior inference in universal probabilistic programming. Retrieved May 24, 2026, from https://4ort.xyz/entity/guaranteed-bounds-for-posterior-inference-in-universal-probabilistic-programming
MLA“Guaranteed bounds for posterior inference in universal probabilistic programming.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/guaranteed-bounds-for-posterior-inference-in-universal-probabilistic-programming.
BibTeX@misc{4ortxyz_guaranteed-bounds-for-posterior-inference-in-universal-probabilistic-programming_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Guaranteed bounds for posterior inference in universal probabilistic programming}}, year = {2026}, url = {https://4ort.xyz/entity/guaranteed-bounds-for-posterior-inference-in-universal-probabilistic-programming}, note = {Accessed: 2026-05-24}}
LLM promptAccording to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Guaranteed bounds for posterior inference in universal probabilistic programming — https://4ort.xyz/entity/guaranteed-bounds-for-posterior-inference-in-universal-probabilistic-programming (retrieved 2026-05-24)