Moment-based analysis of Bayesian network properties
type: Item
instance of: scholarly article
title: Moment-based analysis of Bayesian network properties
author: Miroslav Stankovič
author: Ezio Bartocci
author: Laura Kovács
published in: Theoretical Computer Science
publication date: 2022-02-01T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7467471
zbMATH Keywords: invariant generation
zbMATH Keywords: Bayesian networks
zbMATH Keywords: statistical moments
zbMATH Keywords: linear recurrences
describes a project that uses: MRMC
describes a project that uses: Storm
describes a project that uses: MIM
describes a project that uses: Pyro
describes a project that uses: Figaro
describes a project that uses: PRISM
describes a project that uses: Church
MaRDI profile type: Publication
full work available at URL: j.tcs.2021.12.021
OpenAlex ID: W4200419269
Wikidata QID: Q124212471
cites work: Analysis of Bayesian networks via prob-solvable loops
cites work: A Tutorial on Learning with Bayesian Networks
cites work: Q3446087
cites work: Q3655273
cites work: The computational complexity of probabilistic inference using Bayesian belief networks
cites work: Approximating probabilistic inference in Bayesian belief networks is NP- hard
cites work: Importance sampling algorithms for Bayesian networks: principles and performance
cites work: How long, O Bayesian network, will I sample thee? A program analysis perspective on expected sampling times
cites work: Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops
cites work: Q4031366
cites work: Semantics of probabilistic programs
cites work: Abstraction, Refinement and Proof for Probabilistic Systems
cites work: Q4734791
cites work: Q3870155
cites work: Q5322945
cites work: A probabilistic PDL
cites work: Guarded commands, nondeterminacy and formal derivation of programs
cites work: Linear-Invariant Generation for Probabilistic Programs:
cites work: Counterexample-guided polynomial loop invariant generation by Lagrange interpolation
cites work: Finding Polynomial Loop Invariants for Probabilistic Programs
cites work: Synthesizing Probabilistic Invariants via Doob’s Decomposition
cites work: Q4778698
cites work: FM 2005: Formal Methods
cites work: A probability perspective
cites work: Probabilistic termination: soundness, completeness, and compositionality
cites work: Runtime analysis of probabilistic programs with unbounded recursion
cites work: Weakest Precondition Reasoning for Expected Run–Times of Probabilistic Programs
cites work: Automated termination analysis of polynomial probabilistic programs
DOI: 10.1016/J.TCS.2021.12.021
description: scientific article; zbMATH DE number 7467471