Zobrazeno 1 - 10
of 42
pro vyhledávání: '"LANZINGER, MATTHIAS"'
Database systems are often confronted with queries that join many tables but ultimately only output comparatively small aggregate information. Despite all advances in query optimisation, the explosion of intermediate results as opposed to a much smal
Externí odkaz:
http://arxiv.org/abs/2406.17076
One of the main challenges in the area of Neuro-Symbolic AI is to perform logical reasoning in the presence of both neural and symbolic data. This requires combining heterogeneous data sources such as knowledge graphs, neural model predictions, struc
Externí odkaz:
http://arxiv.org/abs/2403.02933
A large body of work has investigated the properties of graph neural networks and identified several limitations, particularly pertaining to their expressive power. Their inability to count certain patterns (e.g., cycles) in a graph lies at the heart
Externí odkaz:
http://arxiv.org/abs/2402.08595
Autor:
Lanzinger, Matthias, Barceló, Pablo
Seminal research in the field of graph neural networks (GNNs) has revealed a direct correspondence between the expressive capabilities of GNNs and the $k$-dimensional Weisfeiler-Leman ($k$WL) test, a widely-recognized method for verifying graph isomo
Externí odkaz:
http://arxiv.org/abs/2309.17053
Autor:
Lanzinger, Matthias, Razgon, Igor
Generalised hypertree width ($ghw$) is a hypergraph parameter that is central to the tractability of many prominent problems with natural hypergraph structure. Computing $ghw$ of a hypergraph is notoriously hard. The decision version of the problem,
Externí odkaz:
http://arxiv.org/abs/2309.17049
Autor:
Gottlob, Georg, Lanzinger, Matthias, Longo, Davide Mario, Okulmus, Cem, Pichler, Reinhard, Selzer, Alexander
Join queries involving many relations pose a severe challenge to today's query optimisation techniques. To some extent, this is due to the fact that these techniques do not pay sufficient attention to structural properties of the query. In stark cont
Externí odkaz:
http://arxiv.org/abs/2303.02723
We study the fixed-parameter tractability of the following fundamental problem: given two directed graphs $\vec H$ and $\vec G$, count the number of copies of $\vec H$ in $\vec G$. The standard setting, where the tractability is well understood, uses
Externí odkaz:
http://arxiv.org/abs/2211.01905
Structural decomposition methods, such as generalized hypertree decompositions, have been successfully used for solving constraint satisfaction problems (CSPs). As decompositions can be reused to solve CSPs with the same constraint scopes, investing
Externí odkaz:
http://arxiv.org/abs/2209.10375
Extending programming languages with stochastic behaviour such as probabilistic choices or random sampling has a long tradition in computer science. A recent development in this direction is a declarative probabilistic programming language, proposed
Externí odkaz:
http://arxiv.org/abs/2206.12247
Modern applications combine information from a great variety of sources. Oftentimes, some of these sources, like Machine-Learning systems, are not strictly binary but associated with some degree of (lack of) confidence in the observation. We propose
Externí odkaz:
http://arxiv.org/abs/2202.01718