Generative Datalog with continuous distributions
From MaRDI portal
Publication:6551262
DOI10.1145/3559102MaRDI QIDQ6551262
Martin Grohe, Peter Lindner, Benjamin Lucien Kaminski, Joost-Pieter Katoen
Publication date: 6 June 2024
Published in: Journal of the ACM (Search for Journal in Brave)
measure theoryprobabilistic programmingprobabilistic databasesDatalogstochastic kernelsgenerative Datalog
Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Database theory (68P15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Acyclicity notions for existential rules and their application to query answering in ontologies
- Theory of Cryptography
- An Introduction to the Theory of Point Processes
- Elements of finite model theory.
- Taming the infinite chase: query answering under expressive relational constraints
- A probabilistic PDL
- Markov logic networks
- Query answering under probabilistic uncertainty in Datalog\(+/-\) ontologies
- Applying Probability Measures to Abstract Languages
- Semantics of probabilistic programs
- Probabilistic Databases
- Inference and learning in probabilistic logic programs using weighted Boolean formulas
- The expressive power of stratified logic programs with value invention
- Extending ProbLog with Continuous Distributions
- Query Processing on Probabilistic Data: A Survey
- Termination Analysis of Probabilistic Programs with Martingales
- Term Rewriting and Applications
- Measure transformer semantics for Bayesian machine learning
- Statistical Relational Artificial Intelligence: Logic, Probability, and Computation
- Declarative Probabilistic Programming with Datalog
- On the Hardness of Almost–Sure Termination
- Calibrating generative models: the probabilistic Chomsky-Schützenberger hierarchy
Cited In (1)
This page was built for publication: Generative Datalog with continuous distributions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6551262)