Jan-Christoph Kalo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jan-Christoph Kalo has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Wolf-Tilo Balke
TU Braunschweig
4 shared publications Philipp Ehler
Technische Universität Braunschweig
2 shared publications- Stephan Mennicke
TU Dresden
2 shared publications - Denis Nagel
Institut für Informationssysteme TU Braunschweig Braunschweig Germany
1 shared publication - Fabian Hoppe
Vrije Universiteit Amsterdam
1 shared publication - Filip Ilievski
Vrije Universiteit Amsterdam
1 shared publication
Latest Publications
- Open Access
- 21 October 2025
- Published by IOS Press
- p. 1776-1783
Investigating the Robustness of Deductive Reasoning with Large Language Models
Large Language Models (LLMs) have been shown to achieve impressive results for many reasoning-based Natural Language Processing (NLP) tasks, suggesting a degree of deductive reasoning capability. However, it remains unclear to which extent LLMs, in both informal and autoformalisation methods, are robust on logical deduction tasks. Moreover, while many LLM-based deduction methods have been proposed, a systematic study that analyses the impact of their design components is lacking. Addressing these two challenges, we propose the first study of the robustness of formal and informal LLM-based deductive reasoning methods. We devise a framework with two families of perturbations: adversarial noise and counterfactual statements, which jointly generate seven perturbed datasets. We organize the landscape of LLM reasoners according to their reasoning format, formalisation syntax, and feedback for error recovery. The results show that adversarial noise affects autoformalisation, while counterfactual statements influence all approaches. Detailed feedback does not improve overall accuracy despite reducing syntax errors, pointing to the challenge of LLM-based methods to self-correct effectively.
- 21 October 2025
- Published by IOS Press
- p. 1776-1783
Open AccessInvestigating the Robustness of Deductive Reasoning with Large Language Models
Large Language Models (LLMs) have been shown to achieve impressive results for many reasoning-based Natural Language Processing (NLP) tasks, suggesting a degree of deductive reasoning capability. However, it remains unclear to which extent LLMs, in both informal and autoformalisation methods, are robust on logical deduction tasks. Moreover, while many LLM-based deduction methods have been proposed, a systematic study that analyses the impact of their design components is lacking. Addressing these two challenges, we propose the first study of the robustness of formal and informal LLM-based deductive reasoning methods. We devise a framework with two families of perturbations: adversarial noise and counterfactual statements, which jointly generate seven perturbed datasets. We organize the landscape of LLM reasoners according to their reasoning format, formalisation syntax, and feedback for error recovery. The results show that adversarial noise affects autoformalisation, while counterfactual statements influence all approaches. Detailed feedback does not improve overall accuracy despite reducing syntax errors, pointing to the challenge of LLM-based methods to self-correct effectively.
- 1 November 2020
- Published by Springer Nature
- p. 294-310
KnowlyBERT - Hybrid Query Answering over Language Models and Knowledge Graphs
- 1 November 2020
- Published by Springer Nature
- p. 294-310
KnowlyBERT - Hybrid Query Answering over Language Models and Knowledge Graphs
- Open Access
- 27 May 2020
- Published by Springer Nature
- Vol. 12123, 360-375
Detecting Synonymous Properties by Shared Data-Driven Definitions
Knowledge graphs have become an essential source of entity-centric information for modern applications. Today’s KGs have reached a size of billions of RDF triples extracted from a variety of sources, including structured sources and text. While this definitely improves completeness, the inherent variety of sources leads to severe heterogeneity, negatively affecting data quality by introducing duplicate information. We present a novel technique for detecting synonymous properties in large knowledge graphs by mining interpretable definitions of properties using association rule mining. Relying on such shared definitions, our technique is able to mine even synonym rules that have only little support in the data. In particular, our extensive experiments on DBpedia and Wikidata show that our rule-based approach can outperform state-of-the-art knowledge graph embedding techniques, while offering good interpretability through shared logical rules.
- 27 May 2020
- Published by Springer Nature
- Vol. 12123, 360-375
Open AccessDetecting Synonymous Properties by Shared Data-Driven Definitions
Knowledge graphs have become an essential source of entity-centric information for modern applications. Today’s KGs have reached a size of billions of RDF triples extracted from a variety of sources, including structured sources and text. While this definitely improves completeness, the inherent variety of sources leads to severe heterogeneity, negatively affecting data quality by introducing duplicate information. We present a novel technique for detecting synonymous properties in large knowledge graphs by mining interpretable definitions of properties using association rule mining. Relying on such shared definitions, our technique is able to mine even synonym rules that have only little support in the data. In particular, our extensive experiments on DBpedia and Wikidata show that our rule-based approach can outperform state-of-the-art knowledge graph embedding techniques, while offering good interpretability through shared logical rules.
- 17 October 2019
- Published by Springer Nature
- p. 276-292
Knowledge Graph Consolidation by Unifying Synonymous Relationships
- 17 October 2019
- Published by Springer Nature
- p. 276-292
Knowledge Graph Consolidation by Unifying Synonymous Relationships
- Open Access
Fast Dual Simulation Processing of Graph Database Queries (Supplement)
Graph database query languages feature expressive, yet computationally expensive pattern matching capabilities. Answering optional query clauses in SPARQL for instance renders the query evaluation problem immediately Pspace-complete. Therefore, light-weight graph pattern matching relations, such as simulation, have recently been investigated as promising alternatives to more expensive query mechanisms like, e.g., computing subgraph isomorphism. Still, graph pattern matching alone lacks expressive query capabilities: all patterns are combined by usual join constructs, where more sophisticated capabilities would be inevitable for making solutions useful to emerging applications. In this paper we bridge this gap by introducing a new dual simulation process operating on SPARQL queries. In addition to supporting the full syntactic structure of SPARQL queries, it features polynomial-time pattern matching to compute an overapproximation of query results from the database. Moreover, to achieve runtimes competing with state-of-the-art database systems, we develop a novel algorithmic solution to dual simulation graph pattern matching, based on a system of inequalities that allows for several optimization heuristics. Finally, we achieve soundness of our process for SPARQL queries including UNION, AND and OPTIONAL operators not restricted to well-designed patterns. Our experiments on synthetic and real-world graph data promise a clear gain for graph database systems when incorporating the new dual simulation techniques. In this supplement paper we present in detail all proofs, discussions of experimental results, and complexity analysis for the original paper "Fast Dual Simulation Processing of Graph Database Queries" included in the Proceedings of the 35th IEEE International Conference on Data Engineering (ICDE 2019), Macau, China.
Open AccessFast Dual Simulation Processing of Graph Database Queries (Supplement)
Graph database query languages feature expressive, yet computationally expensive pattern matching capabilities. Answering optional query clauses in SPARQL for instance renders the query evaluation problem immediately Pspace-complete. Therefore, light-weight graph pattern matching relations, such as simulation, have recently been investigated as promising alternatives to more expensive query mechanisms like, e.g., computing subgraph isomorphism. Still, graph pattern matching alone lacks expressive query capabilities: all patterns are combined by usual join constructs, where more sophisticated capabilities would be inevitable for making solutions useful to emerging applications. In this paper we bridge this gap by introducing a new dual simulation process operating on SPARQL queries. In addition to supporting the full syntactic structure of SPARQL queries, it features polynomial-time pattern matching to compute an overapproximation of query results from the database. Moreover, to achieve runtimes competing with state-of-the-art database systems, we develop a novel algorithmic solution to dual simulation graph pattern matching, based on a system of inequalities that allows for several optimization heuristics. Finally, we achieve soundness of our process for SPARQL queries including UNION, AND and OPTIONAL operators not restricted to well-designed patterns. Our experiments on synthetic and real-world graph data promise a clear gain for graph database systems when incorporating the new dual simulation techniques. In this supplement paper we present in detail all proofs, discussions of experimental results, and complexity analysis for the original paper "Fast Dual Simulation Processing of Graph Database Queries" included in the Proceedings of the 35th IEEE International Conference on Data Engineering (ICDE 2019), Macau, China.