An Asymptotic Analysis of Probabilistic Logic Programming, with Implications for Expressing Projective Families of Distributions
DOI10.1017/s1471068421000314zbMath1530.68061arXiv2102.08777OpenAlexW3208606349MaRDI QIDQ6063870
Publication date: 12 December 2023
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.08777
finite model theorydistribution semanticsprobabilistic logic programmingasymptotic quantifier eliminationdeterminate logic programsprojective families of distributions
Logic in artificial intelligence (68T27) Probability and inductive logic (03B48) Model theory of finite structures (03C13) Logic programming (68N17)
Cites Work
- Unnamed Item
- Unnamed Item
- Probabilistic (logic) programming concepts
- Fixpoint semantics for logic programming a survey
- Conditional probability logic, lifted Bayesian networks, and almost sure quantifier elimination
- The finite model theory of Bayesian network specifications: descriptive complexity and zero/one laws
- Complexity of the first-order theory of almost all finite structures
- Almost everywhere elimination of probability quantifiers
- A zero-one law for logic with a fixed-point operator
- In Praise of Impredicativity: A Contribution to the Formalization of Meta-Programming
- Pure Inductive Logic
- Finite Model Theory
This page was built for publication: An Asymptotic Analysis of Probabilistic Logic Programming, with Implications for Expressing Projective Families of Distributions
