Church

swMATH8946MaRDI QIDQ20942FDOQ20942

Author name not available (Why is that?)

Official website: http://arxiv.org/ftp/arxiv/papers/1206/1206.3255.pdf

Cited In (75)

• Title not available (Why is that?)
• Lifted Bayesian filtering in multiset rewriting systems
• The geometry of Bayesian programming
• A monad for probabilistic point processes
• The scope and limits of simulation in automated reasoning
• Probabilistic logic programming for hybrid relational domains
• PRISM revisited: declarative implementation of a probabilistic programming language using multi-prompt delimited control
• Probabilistic programming language and its incremental evaluation
• On higher-order probabilistic subrecursion
• A Convenient Category for Higher-Order Probability Theory
• The magic of logical inference in probabilistic programming
• Probabilistic modelling, inference and learning using logical theories
• Probabilistic termination by monadic affine sized typing
• Probabilities on sentences in an expressive logic
• A functional account of probabilistic programming with possible worlds. Declarative pearl
• Semiring programming: a semantic framework for generalized sum product problems
• A model-learner pattern for bayesian reasoning
• Title not available (Why is that?)
• Quasi-Borel Spaces
• An application of computable distributions to the semantics of probabilistic programming languages
• Commutative semantics for probabilistic programming
• Metric reasoning about \(\lambda\)-terms: the general case
• Contextual equivalence for probabilistic programs with continuous random variables and scoring
• Probabilistic inference by program transformation in Hakaru (system description)
• Optimal speech motor control and token-to-token variability: a Bayesian modeling approach
• Distributional logic programming for Bayesian knowledge representation
• \(T_{\mathcal{P}}\)-compilation for inference in probabilistic logic programs
• Controlling procedural modeling programs with stochastically-ordered sequential Monte Carlo
• Measure transformer semantics for Bayesian machine learning
• Probabilistic abductive logic programming using Dirichlet priors
• Program logic for higher-order probabilistic programs in Isabelle/HOL
• Curry
• FACTORIE
• IBAL
• EasyCheck
• Filzbach
• foxPSL
• PAKCS
• Purely functional lazy non-deterministic programming
• A new probabilistic constraint logic programming language based on a generalised distribution semantics
• A new approach for conditioning process-based geologic models to well data
• Probabilistic (logic) programming concepts
• PRISM
• Datafun
• Pyro
• BLOG
• PR-OWL
• cplint
• Dyna
• ClaimEval
• DENDRAL
• HyPER
• Swift
• Anglican
• Computable de Finetti measures
• Beginner's luck: a language for property-based generators
• Dsharp
• A denotational semantics for low-level probabilistic programs with nondeterminism
• RankPL: a qualitative probabilistic programming language
• Moment-based analysis of Bayesian network properties
• Planning in hybrid relational MDPs
• The EfProb library for probabilistic calculations
• Computable exchangeable sequences have computable de Finetti measures
• Learning probabilistic logic programs over continuous data
• A generalization of hierarchical exchangeability on trees to directed acyclic graphs
• Structured learning modulo theories
• Herded Gibbs sampling
• Generic inference in latent Gaussian process models
• Conditioning in probabilistic programming
• Hinge-loss Markov random fields and probabilistic soft logic
• Automatic differentiation variational inference
• Implementing a library for probabilistic programming using non-strict non-determinism
• TensorLog: a probabilistic database implemented using deep-learning infrastructure
• The finite model theory of Bayesian network specifications: descriptive complexity and zero/one laws
• Measure transformer semantics for Bayesian machine learning

This page was built for software: Church