19 citations · 51 across the 18 of their papers we have counts for
18 papers
The Boolean Power of ReLU
Pablo Barceló, Floris Geerts, Matthias Lanzinger +2
We prove that, on finite simple undirected graphs equipped with a single Boolean node feature, the Boolean queries expressible in -MPLang, for any collection of eventually c…
MLSkip: Data Skipping for ML Filters via Lightweight Metadata
Mihail Stoian, Mark Gerarts, Pascal Ginter +3
Database vendors recently released AI functions that can be used in filter predicates. As such functions often rely on costly, black-box ML models, they unveil new data management…
The KG-ER Conceptual Schema Language
Enrico Franconi, Benoît Groz, Jan Hidders +4
We propose KG-ER, a conceptual schema language for knowledge graphs that describes the structure of knowledge graphs independently of their representation (relational databases, pr…
Preservation theorems for Tarski's relation algebra
Bart Bogaerts, Balder ten Cate, Brett McLean +1
We investigate a number of semantically defined fragments of Tarski's algebra of binary relations, including the function-preserving fragment. We address the question whether they…
Learning Graph Neural Networks using Exact Compression
Jeroen Bollen, Jasper Steegmans, Jan Van den Bussche +1
Graph Neural Networks (GNNs) are a form of deep learning that enable a wide range of machine learning applications on graph-structured data. The learning of GNNs, however, is known…
Expressiveness within Sequence Datalog
Heba Aamer, Jan Hidders, Jan Paredaens +1
Motivated by old and new applications, we investigate Datalog as a language for sequence databases. We reconsider classical features of Datalog programs, such as negation, recursio…
What Can Database Query Processing Do for Instance-Spanning Constraints?
Heba Aamer, Marco Montali, Jan Van den Bussche
In the last decade, the term instance-spanning constraint has been introduced in the process mining field to refer to constraints that span multiple process instances of one or sev…
Temporal graph patterns by timed automata
Amir Pouya Aghasadeghi, Jan Van den Bussche, Julia Stoyanovich
Temporal graphs represent graph evolution over time, and have been receiving considerable research attention. Work on expressing temporal graph patterns or discovering temporal mot…
On the expressive power of message-passing neural networks as global feature map transformers
Floris Geerts, Jasper Steegmans, Jan Van den Bussche
We investigate the power of message-passing neural networks (MPNNs) in their capacity to transform the numerical features stored in the nodes of their input graphs. Our focus is on…
Learning with Value-Ramp
Tom J. Ameloot, Jan Van den Bussche
We study a learning principle based on the intuition of forming ramps. The agent tries to follow an increasing sequence of values until the agent meets a peak of reward. The result…
On the convergence of cycle detection for navigational reinforcement learning
Tom J. Ameloot, Jan Van den Bussche
We consider a reinforcement learning framework where agents have to navigate from start states to goal states. We prove convergence of a cycle-detection learning algorithm on a cla…
Positive Neural Networks in Discrete Time Implement Monotone-Regular Behaviors
Tom J. Ameloot, Jan Van den Bussche
We study the expressive power of positive neural networks. The model uses positive connection weights and multiple input neurons. Different behaviors can be expressed by varying th…
Undecidability of satisfiability in the algebra of finite binary relations with union, composition, and difference
Tony Tan, Jan Van den Bussche, Xiaowang Zhang
We consider expressions built up from binary relation names using the operators union, composition, and set difference. We show that it is undecidable to test whether a given such…
On the satisfiability problem for SPARQL patterns
Xiaowang Zhang, Jan Van den Bussche, François Picalausa
The satisfiability problem for SPARQL patterns is undecidable in general, since the expressive power of SPARQL 1.0 is comparable with that of the relational algebra. The goal of th…
FO(C) and Related Modelling Paradigms
Bart Bogaerts, Joost Vennekens, Marc Denecker +1
Recently, C-Log was introduced as a language for modelling causal processes. Its formal semantics has been defined together with introductory examples, but the study of this langua…
Inference in the FO(C) Modelling Language
Bart Bogaerts, Joost Vennekens, Marc Denecker +1
Recently, FO(C), the integration of C-Log with classical logic, was introduced as a knowledge representation language. Up to this point, no systems exist that perform inference on…
Mining tree-query associations in graphs
Eveline Hoekx, Jan Van den Bussche
New applications of data mining, such as in biology, bioinformatics, or sociology, are faced with large datasetsstructured as graphs. We introduce a novel class of tree-shapedpatte…
Towards practical meta-querying
Jan Van den Bussche, Stijn Vansummeren, Gottfried Vossen
We describe a meta-querying system for databases containing queries in addition to ordinary data. In the context of such databases, a meta-query is a query about queries. Represent…