Learning on graphs is one of the most active research topics in machine learning (ML). Among the key challenges in this field, effectively learning long-range dependencies in graphs has been particularly difficult. It has been observed that, in practice, the performance of many ML approaches, including various types of graph neural networks (GNNs), degrades significantly when the learning task involves long-range dependencies—that is, when the answer is determined by the presence of a certain path of significant length in the graph. This issue has been attributed to several phenomena, including over-smoothing, over-squashing, and vanishing gradient. A number of solutions have been proposed to mitigate these causes. However, evaluation of these solutions is currently challenging because existing benchmarks do not effectively test systems for their ability to learn tasks based on long-range dependencies in a transparent manner. In this paper, we introduce GLoRa, a synthetic benchmark that allows testing of systems for this ability in a systematic way. We then evaluate state-of-the-art systems using GLoRa and conclude that none of them can confidently claim to learn long-range dependencies well. We also observe that this weak performance cannot be attributed to any of the three causes, highlighting the need for further investigation.

Retrieval-Augmented Generation (RAG) enhances large language models by incorporating external knowledge, yet suffers from critical limitations in high-stakes domains—namely, sensitivity to noisy or contradictory evidence and opaque, stochastic decision-making. We propose \textsc{ArgRAG}, an explainable, and contestable alternative that replaces black-box reasoning with structured inference using a Quantitative Bipolar Argumentation Framework (QBAF). \textsc{ArgRAG} constructs a QBAF from retrieved documents and performs deterministic reasoning under gradual semantics. This allows faithfully explanaining and contesting decisions. Evaluated on two fact verification benchmarks, PubHealth and RAGuard, \textsc{ArgRAG} achieves strong accuracy while significantly improving transparency.

Data analytics including machine learning (ML) is essential to extract insights from production data in modern industries. However, industrial ML is affected by: the low transparency of ML towards non-ML experts; poor and non-unified descriptions of ML practices for reviewing or comprehension; ad-hoc fashion of ML solutions tailored to specific applications, which affects their re-usability. To address these challenges, we propose the concept and a system of executable knowledge graph (KG), which represent KGs that rely on semantic technologies to formally encode ML knowledge and solutions. These KGs can be translated to executable scripts in a reusable and modularised fashion. The demo attendees will use our system to modify, integrate and create executable KGs via a graphic user interface, which offer a user-friendly way to understand, configure, reuse, and create data analytics pipelines.

With the development of Industry 4.0 technology, modern industries such as Bosch's welding monitoring witnessed the rapid widespread of machine learning (ML) based data analytical applications, which in the case of welding monitoring has led to more efficient and accurate welding monitoring quality. However, industrial ML is affected by the low transparency of ML towards non-ML experts needs. The lack of understanding by domain experts of ML methods hampers the application of ML methods in industry and the reuse of developed ML pipelines, as ML methods are often developed in an ad hoc manner for specific problems. To address these challenges, we propose the concept and a system of executable Knowledge Graph (KG), which formally encode ML knowledge and solutions in KGs, which serve as common language between ML experts and non-ML experts, thus facilitate their communication and increase the transparency of ML methods. We evaluated our system extensively with an industrial use case at Bosch, showing promising results.

Automatic knowledge graph (KG) construction is widely used for e.g. data integration, question answering and semantic search. There are many approaches of automatic KG construction. Among which, an important approach is to map the raw data to a given domain KG schema, e.g., domain ontology or conceptual graph, and construct the entities and properties according to the domain KG schema. However, the existing approaches to construct KGs are not always efficient enough and the resulting KGs are not sufficiently application and user-friendly. The main challenge arises from the trade-off: the domain KG schema should be domain-generic and knowledge-oriented, to reflect the general domain knowledge rather than data particularities; while a KG schema should be data-oriented, to cover all data features. If the former is directly used for KG construction, this can cause issues like a high load of blank nodes, which are technical nodes in the KGs that represent unknown entities. To this end, we propose our ScheRe system in the demo, which relies on a schema reshaping algorithm and other two semantic modules for enhancing KG construction. The demo attendees will use ScheRe to reshape a domain KG schema to data specific KG schema, build KGs with industrial data, and experience more user-friendly querying.