On the Representation of Probabilities over Structured Domains
Abstract elided by the publisher.
Related papers
- SPPL: probabilistic programming with fast exact symbolic inference PLDI 2021
- Guiding dynamic programing via structural probability for accelerating programming by example OOPSLA 2020
- Abstract Interpretation by Dynamic Partitioning JFP 1992
- Certifying Certainty and Uncertainty in Approximate Membership Query Structures CAV 2020
- Incremental Inference for Probabilistic Datalog CAV 2026
- Enriched Presheaf Model of Quantum FPC POPL 2024
- Formal Probabilistic Methods for Combinatorial Structures using the Lovász Local Lemma CPP 2024
- Mode Modules as Representations of Domains POPL 1973