Projects
Bayesioan estimation techniques, probabilistic relation models, higher-level knowledge representations and invariant motion descriptions for multi-target tracking and intent estimation in robotics. KU Leuven
From Atoms to Possible Worlds: Probabilistic Inference in the Discrete-Continuous Domain KU Leuven
Life is uncertain, full of ambiguities. Paradoxically, only embracing stochasticity, not fighting randomness, lets us cut through the surrounding fog of noise and find meaning. Similarly, machines will only make sense of the world accepting its probabilistic nature.
This dissertation studies probabilistic artificial intelligence, a broad field of research. We will investigate probabilistic AI at three distinct conceptual levels, or ...
A Scalable, Distributed Infrastructure for Probabilistic Databases. University of Antwerp
Syndetic and asyndetic complementation in Spanish. A diachronic probabilistic account KU Leuven
My dissertation focuses on the alternation between syndetic and asyndetic finite complement clauses in Spanish. Syndetic complements, introduced by an explicit complementizer que ‘that’, as in (1a), are the most frequent patterns of complementation in Present‑day Spanish. Alternatively, a complement clause can also be introduced asyndetically, i.e. without the complementizer que, as shown in (1b), where the absence of the complementizer is ...
Probabilistic logic programming for dynamic relational worlds KU Leuven
Harnessing Probabilistic Programming for Dynamic Network Modelling KU Leuven
Declarative programming is the idea that a program should describe what it does, which problem it is solving, not how it does so. In this fashion, declarative programming focuses on the complexity that is inherent in the problem, not the accidental complexity that originates from solving the problem on a computer. By reducing accidental complexity, declarative programming eliminates a common source of bugs. This ...
Probabilistic Logics for Biological Network Inference. KU Leuven
ProbLog is a probabilistic extention of the programming language Prolog, which has been developed at the K.U.leuven. It can be used to calculate the succes probability of a query, based on probabilistic facts and deterministic Prolog rules. The main motivation for the creation of this language was the emergence of large probabilistic networks in the field of Bio-informatics. These networks are the result of high-throughput experiments that ...
The register-specificity of probabilistic grammars in English and Dutch - Combining corpus analysis and experimentation KU Leuven
Register variation has enjoyed plenty of attention from a text-linguistic perspective and using the Multidimensional Approach (following Biber 1988). In variationist sociolinguistics, on the other hand, register has not often been examined in interaction with language-internal constraints in morphosyntactic variation research so that register’s role in probabilistic, grammatical choice-making remains unclear. Sociolinguistic theory predicts ...
Probabilistic Relational Models in Dynamical Domains: A Unified Treatment. KU Leuven
Reasoning about uncertainty in dynamical worlds is a fundamental problem in the area of artificial intelligence (AI). Consider a robot navigating the home of a person: first, the robot cannot know all the objects present, or more generally, the world is incompletely known; and second, the robot has to be careful when manipulating fragile objects and moving around, or more generally, it has to effectively reason about the changes due to its ...