Monads for measurable queries in probabilistic databases

DOI10.4204/EPTCS.351.3MaRDI QIDQ6653746zbMATH OpenFDO

Authors Swaraj Dash, Sam Staton

Publication date 17 December 2024

Full work available at URL https://doi.org/10.4204/EPTCS.351.3

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)

Cites work

• A monad for probabilistic point processes
• Axioms for probability and nondeterminism
• Borel structures for function spaces
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Combining probabilistic and non-deterministic choice via weak distributive laws
• CP-logic: A language of causal probabilistic events and its relation to logic programming
• Distributing probability over non-determinism
• scientific article; zbMATH DE number 6712178 (Why is no real title available?)
• scientific article; zbMATH DE number 3764843 (Why is no real title available?)
• scientific article; zbMATH DE number 3296291 (Why is no real title available?)
• Infinite Probabilistic Databases
• Monads and Quantitative Equational Theories for Nondeterminism and Probability
• Multinomial and hypergeometric distributions in Markov categories
• Notions of computation and monads
• Open-world probabilistic databases: semantics, algorithms, complexity
• Probabilistic (logic) programming concepts
• The coincidence approach to stochastic point processes
• The general theory of stochastic population processes

Cited in

(2)

• Multinomial and hypergeometric distributions in Markov categories
• Element-free probability distributions and random partitions

This page was built for publication: Monads for measurable queries in probabilistic databases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6653746)