We give logical characterizations of bisimulation relations for the probabilistic automata of Segala in terms of three Hennessy-Milner style logics. The three logics characterize s...
We discuss how to learn non-recursive directed probabilistic logical models from relational data. This problem has been tackled before by upgrading the structure-search algorithm i...
Daan Fierens, Jan Ramon, Maurice Bruynooghe, Hendr...
Modal logics based on Kripke style semantics are the prominent formalismin AI for modeling beliefs. Kripke semantics involve a collection of possible worlds and a relation among t...
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
This paper presents a probabilistic model for Japanese zero anaphora resolution. First, this model recognizes discourse entities and links all mentions to them. Zero pronouns are ...