An intelligent agent interacting with the real world will encounter individual people, courses,
test results, drugs prescriptions, chairs, boxes, etc., and needs to reason about properties of …

We give an overview of recent advances on the graph isomorphism problem. Our main focus
will be on Babai's quasi-polynomial time isomorphism test and subsequent developments …

Lifted graphical models provide a language for expressing dependencies between different
types of entities, their attributes, and their diverse relations, as well as techniques for …

Several state-of-the-art event extraction systems employ models based on Support Vector
Machines (SVMs) in a pipeline architecture, which fails to exploit the joint dependencies that …

Abstract The Weisfeiler-Leman (WL) algorithm is a fundamental combinatorial technique
used to classify graphs and other relational structures. It dates back to the 1960s and has …

We look at probabilistic first-order formalisms where the domain objects are known. In these
formalisms, the standard approach for inference is lifted variable elimination. To benefit from …

Colour refinement is a basic algorithmic routine for graph isomorphism testing, appearing as
a subroutine in almost all practical isomorphism solvers. It partitions the vertices of a graph …

Probabilistic models involving relational and temporal aspects need exact and efficient
inference algorithms. Existing approaches are approximative, include unnecessary …

Abstract Background: Big Data is a relatively new field of research and technology, and
literature reports a wide variety of concepts labeled with Big Data. The maturity of a research …

Lifted probabilistic inference exploits symmetries in a probabilistic model to allow for
tractable probabilistic inference with respect to domain sizes. To apply lifted inference, a …