Random expansions of finite structures with bounded degree
From MaRDI portal
Cites work
- A logical limit law for \(231\)-avoiding permutations
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Almost everywhere elimination of probability quantifiers
- 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
- Asymptotic normality of fringe subtrees and additive functionals in conditioned Galton-Watson trees
- Conditional probability logic, lifted Bayesian networks, and almost sure quantifier elimination
- Convergence and Nonconvergence Laws for Random Expansions of Product Structures
- Convergence laws for expansions of linear preorders
- Discrete metric spaces: structure, enumeration, and 0-1 laws
- Expansions of geometries
- scientific article; zbMATH DE number 1324669 (Why is no real title available?)
- scientific article; zbMATH DE number 1557173 (Why is no real title available?)
- scientific article; zbMATH DE number 1392295 (Why is no real title available?)
- scientific article; zbMATH DE number 7297830 (Why is no real title available?)
- Infinitary logics and 0-1 laws
- Investigations into the sentential calculus
- K l+1 -Free Graphs: Asymptotic Structure and a 0-1 Law
- Lifted graphical models: a survey
- MSO zero-one laws on random labelled acyclic graphs
- On 0, 1-laws and asymptotics of definable sets in geometric Fraïssé classes
- On general subtrees of a conditioned Galton-Watson tree
- On probabilistic elimination of generalized quantifiers
- On the relative asymptotic expressivity of inference frameworks
- On the zero-one k-law extensions
- Probabilistic graphical models.
- Probabilities on finite models
- Random expansions of trees with bounded height
- Statistical relational artificial intelligence: logic, probability, and computation
- The finite model theory of Bayesian network specifications: descriptive complexity and zero/one laws
- The logic of random regular graphs
- 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
(3)
This page was built for publication: Random expansions of finite structures with bounded degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6889205)