Lifted graphical models: a survey

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 probabilistic reasoning in such multi-relational domains. In this survey, we review a general form for a lifted graphical model, a par-factor graph, and show how a number of existing statistical relational representations map to this formalism. We discuss inference algorithms, including lifted inference algorithms, that efficiently compute the answers to probabilistic queries over such models. We also review work in learning lifted graphical models from data. There is a growing need for statistical relational models (whether they go by that name or another), as we are inundated with data which is a mix of structured and unstructured, with entities and relations extracted in a noisy manner from text, and with the need to reason effectively with this data. We hope that this synthesis of ideas from many different research groups will provide an accessible starting point for new researchers in this expanding field

Compressing probabilistic Prolog programs

Peer reviewe

Learning Logic Programs by Discovering Higher-Order Abstractions

Discovering novel abstractions is important for human-level AI. We introduce an approach to discover higher-order abstractions, such as map, filter, and fold. We focus on inductive logic programming, which induces logic programs from examples and background knowledge. We introduce the higher-order refactoring problem, where the goal is to compress a logic program by introducing higher-order abstractions. We implement our approach in STEVIE, which formulates the higher-order refactoring problem as a constraint optimisation problem. Our experimental results on multiple domains, including program synthesis and visual reasoning, show that, compared to no refactoring, STEVIE can improve predictive accuracies by 27% and reduce learning times by 47%. We also show that STEVIE can discover abstractions that transfer to different domain

On the modeling and real-time control of urban drainage systems: A survey

Drainage networks are complex systems composed by several processes including recollection, transport, storing, treatment, and releasing the water to a receiving environment. The way Urban Drainage Systems (UDS) manage wastewater is through the convenient handling of active elements such as gates (redirection and/or retention), storing tanks, and pumping stations, when needed. Therefore, modeling and control of UDS basically consists in knowing and representing the (dynamical) behavior of these elements and managing them properly in order to achieve a given set of control objectives, such as minimization of flooding in streets or maximization of treated wastewater in the system. Given the large number of elements composing an UDS and the interaction between them, management and control strategies may depend on highly complex system models, which implies the explicit difficulty for designing real-time control (RTC) strategies. This paper makes a review of the models used to describe, simulate, and control UDS, proposes a revision of the techniques and strategies commonly used for the control UDS, and finally compares several control strategies based on a case study.Peer ReviewedPostprint (author’s final draft