Monthly Archives: April 2019

Federico Cerutti visiting

Federico Cerutti from Cardiff University is visiting us this Thursday. He will give a talk on Probabilistic Logic Programming with Beta-Distributed Random Variables.

Abstract: We enable aProbLog—a probabilistic logical programming approach—to reason in presence of uncertain probabilities represented as Beta-distributed random variables. We achieve the same performance of state-of-the-art algorithms for highly specified and engineered domains, while simultaneously we maintain the flexibility offered by aProbLog in handling complex relational domains.
Our motivation is that faithfully capturing the distribution of probabilities is necessary to compute an expected utility for effective decision making under uncertainty: unfortunately, these probability distributions can be highly uncertain due to sparse data. To understand and accurately manipulate such probability distributions we need a well-defined theoretical framework that is provided by the Beta distribution, which specifies a distribution of probabilities representing all the possible values of a probability when the exact value is unknown.

Philipp Schlicht visiting

Philipp Schlicht is visiting us today from Bristol. He’ll give us an introduction to automatic structures in the theory seminar today (2pm, CoFo 201).

Abstract: Automatic structures were first studied by Khoussainov and Nerode in 1995. I will first give an introduction with a focus on automatic ordinals and groups and then talk about tree-automatic structures. In particular, I will mention some recent partial results with Jain, Khoussainov and Stephan on the isomorphism problem for tree-automatic ordinals.