Felix Weitkämper

An asymptotic analysis of probabilistic logic programming, with\n implications for expressing projective families of distributions

2021 · arXiv (Cornell University)

Probabilistic logic programming is a major part of statistical relational\nartificial intelligence, where approaches from logic and probability are\nbrought together to reason about and learn from relational domains in a setting\nof uncertainty. However, the behaviour of …

On the relative asymptotic expressivity of inference frameworks

2024 · Logical Methods in Computer Science

We consider logics with truth values in the unit interval $[0,1]$. Such logics are used to define queries and to define probability distributions. In this context the notion of almost sure equivalence of formulas is …