Managing research digital objects (RDOs) in compliance with FAIR principles is crucial for ensuring accessibility, interoperability, and reusability across scientific domains. The Leibniz Data Manager (LDM) is a state-of-the-art framework that integrates Knowledge Graphs (KGs) and Neuro-Symbolic AI, combining the reasoning power of Large Language Models (LLMs) with structured metadata. LDM supports the management and enhancement of RDOs through entity linking, connecting datasets to external KGs like Wikidata and the Open Research Knowledge Graph (ORKG). Additionally, LDM offers federated query processing across KGs, enabling users to explore related papers, datasets, and resources through natural language questions. This demo showcases LDM's capabilities to explore RDOs, compare existing datasets, and extend metadata. By blending Neuro-Symbolic AI with FAIR and federated research data management, LDM offers a powerful tool for accelerating data-driven discovery in science. LDM is publicly accessible at https://service.tib.eu/ldmservice/.

Chronic hepatitis B virus (HBV) infection is still a global health problem, with over 296 million chronically HBV-infected individuals worldwide. The merging data about clinical parameters, immune phenotyping data, and genetic information, together with AI models reliant on this integrated information, holds promise in effectively predicting the likelihood of functional cure in HBV-infected patients. Yet, the limited size of multidimensional datasets and characteristic of HBV cases poses a challenge for machine learning (ML) systems that typically require substantial data for pattern recognition. This paper addresses this challenge by introducing HyAI, a hybrid AI framework. HyAI employs knowledge graphs (KGs) and inductive learning to unearth meaningful patterns. HyAI relies on KG embedding models to learn a numerical representation of the HyAI KG in a k-dimensional vector space. Through community detection methods, closely related HBV patients are clustered using similarity metrics formulated from the acquired embeddings. HyAI is studied in a population of HBV patients integrated with multidimensional datasets. Our empirical analysis shows that HyAI uncovers immune markers that, together with clinical and demographic parameters, correspond to good predictors for forecasting the cure of chronic HBV infection.

Knowledge graphs (KGs) naturally capture the convergence of data and knowledge, making them expressive frameworks for describing and integrating heterogeneous data in a coherent and interconnected manner. However, based on the Open World Assumption (OWA), the absence of information within KGs does not indicate falsity or non-existence; it merely reflects incompleteness. Inductive learning over KGs involves predicting new relationships based on existing statements in the KG, using either numerical or symbolic learning models. The Partial Completeness Assumption (PCA) heuristic efficiently guides inductive learning methods for Link Prediction (LP) by refining predictions about absent KG relationships. Nevertheless, numeric techniques– like KG embedding models– alone may fall short in accurately predicting missing information, particularly when it comes to capturing implicit knowledge and complex relationships. We propose a hybrid method named SPaRKLE that seamlessly integrates symbolic and numerical techniques, leveraging the PCA heuristic to capture implicit knowledge and enrich KGs. We empirically compare SPaRKLE with state-of-the-art KG embedding and symbolic models, using established benchmarks. Our experimental outcomes underscore the efficacy of this hybrid approach, as it harnesses the strengths of both paradigms. SPaRKLE is publicly available on GitHub1.

Capturing knowledge about Drug-Drug Interactions (DDI) is a crucial factor to support clinicians in better treatments. Nowadays, public drug databases provide a wealth of information on drugs that can be exploited to enhance tasks, e.g., data mining, ranking, and query answering. However, all the interactions in the public database are focused on pairs of drugs. Since current treatments are composed of multi-drugs, it is extremely challenging to know which potential drugs affect the effectiveness of the treatment. In this work, we tackle the problem of discovering DDIs and reduce this problem to link prediction over a property graph represented in RDF-star. A deductive system captures knowledge about the conditions that define when a group of drugs interacts as Datalog rules. Extensional statements represent the property graph. Lastly, the intensional rules guide the deduction process to discover relationships in the graph and their properties. As a proof concept, we have implemented a graph traversal method on top of the property graph and the deduced edges. The technique aims to identify the combination of drugs whose interactions may reduce the effectiveness of a treatment or increase the number of toxicities. This traversal method relies on the computation of wedges in the property graph. Albeit illustrated in the context of DDI, this method could be generalized to other link traversal tasks. We conduct an experimental study on a DDIs property graph for different treatments. The results suggest that by capturing knowledge about DDIs, our approach can discover the drugs that decrease the effectiveness of the treatment. Our results are promising and suggest that clinicians can better understand the DDIs in treatment and prescribe improved treatments through the knowledge captured by our approach.