N'Dah Jean Kouagou

N'Dah Jean Kouagou

Auto-generated profile, based on publicly available information

N'Dah Jean Kouagou

Paderborn University

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
31 May 2022
Verified
Book Chapter
Closed access
PDF file
NKN’dah Jean Kouagou
N’dah Jean Kouagou
SHStefan Heindorf
Stefan Heindorf
CDCaglar Demir
Caglar Demir
ANAxel-Cyrille Ngonga Ngomo
Axel-Cyrille Ngonga Ngomo

22 May 2023
Verified
Book Chapter
Closed access
PDF file
NKN’dAh Jean Kouagou
N’dAh Jean Kouagou
SHStefan Heindorf
Stefan Heindorf
CDCaglar Demir
Caglar Demir
ANAxel-Cyrille Ngonga Ngomo
Axel-Cyrille Ngonga Ngomo

18 September 2023
Verified
Book Chapter
Closed access
PDF file
NKN’dAh Jean Kouagou
N’dAh Jean Kouagou
SHStefan Heindorf
Stefan Heindorf
CDCaglar Demir
Caglar Demir
ANAxel-Cyrille Ngonga Ngomo
Axel-Cyrille Ngonga Ngomo

13 May 2024
Verified
Conference Paper
Open access
NKN'DAh Jean Kouagou
N'DAh Jean Kouagou
CDCaglar Demir
Caglar Demir
HZHamada M. Zahera
Hamada M. Zahera
AWAdrian Wilke
Adrian Wilke
SHStefan Heindorf
Stefan Heindorf
ANAxel-Cyrille Ngonga Ngomo
Axel-Cyrille Ngonga Ngomo

1 August 2024
Verified
Conference Paper
Open access
PDF file
NKN'Dah Jean Kouagou
N'Dah Jean Kouagou
SHStefan Heindorf
Stefan Heindorf
CDCaglar Demir
Caglar Demir
ANAxel-Cyrille Ngonga Ngomo
Axel-Cyrille Ngonga Ngomo
We consider the problem of class expression learning using cardinality-minimal sets of examples. Recent class expression learning approaches employ deep neural networks and have demonstrated tremendous performance improvements in execution time and quality of the computed solutions. However, they lack generalization capabilities when it comes to the number of examples used in a learning problem, i.e., they often perform poorly on unseen learning problems where only a few examples are given. In this work, we propose a generalization of the classical class expression learning problem to address the limitations above. In short, our generalized learning problem (GLP) forces learning systems to solve the classical class expression learning problem using the smallest possible subsets of examples, thereby improving the learning systems' ability to solve unseen learning problems with arbitrary numbers of examples. Moreover, we develop ROCES, a learning algorithm for synthesis-based approaches to solve GLP. Experimental results suggest that post training, ROCES outperforms existing synthesis-based approaches on out-of-distribution learning problems while remaining highly competitive overall.

13 October 2025 in arXiv
Verified
Preprint
Open access
PDF file
CDCaglar Demir
Caglar Demir
ABAlkid Baci
Alkid Baci
NKN'Dah Jean Kouagou
N'Dah Jean Kouagou
LSLeonie Nora Sieger
Leonie Nora Sieger
SHStefan Heindorf
Stefan Heindorf
ANAxel-Cyrille Ngonga Ngomo
Axel-Cyrille Ngonga Ngomo
In this paper, we present Ontolearn-a framework for learning OWL class expressions over large knowledge graphs. Ontolearn contains efficient implementations of recent stateof-the-art symbolic and neuro-symbolic class expression learners including EvoLearner and DRILL. A learned OWL class expression can be used to classify instances in the knowledge graph. Furthermore, Ontolearn integrates a verbalization module based on an LLM to translate complex OWL class expressions into natural language sentences. By mapping OWL class expressions into respective SPARQL queries, Ontolearn can be easily used to operate over a remote triplestore. The source code of Ontolearn is available at https://github.com/dice-group/Ontolearn.