Random expansions of trees with bounded height
From MaRDI portal
Cites work
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Almost sure theories
- An Asymptotic Analysis of Probabilistic Logic Programming, with Implications for Expressing Projective Families of Distributions
- An introduction to many-valued and fuzzy logic. Semantics, algebras, and derivation systems
- Asymptotic elimination of partially continuous aggregation functions in directed graphical models
- Conditional probability logic, lifted Bayesian networks, and almost sure quantifier elimination
- Convergence and Nonconvergence Laws for Random Expansions of Product Structures
- Expansions of geometries
- scientific article; zbMATH DE number 1392295 (Why is no real title available?)
- scientific article; zbMATH DE number 7297830 (Why is no real title available?)
- scientific article; zbMATH DE number 7330888 (Why is no real title available?)
- Investigations into the sentential calculus
- Lifted graphical models: a survey
- On the relative asymptotic expressivity of inference frameworks
- Probabilistic graphical models.
- Probabilities on finite models
- Random \(\ell\)-colourable structures with a pregeometry
- Random expansions of finite structures with bounded degree
- Statistical relational artificial intelligence: logic, probability, and computation
- The finite model theory of Bayesian network specifications: descriptive complexity and zero/one laws
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Zero-one laws for graphs with edge probabilities decaying with distance. Part I
- Zero-One Laws for Sparse Random Graphs
Cited in
(4)
This page was built for publication: Random expansions of trees with bounded height
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6994522)