Mirko Lenz
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Mirko Lenz has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Ralph Bergmann
German Research Center for Artificial Intelligence (DFKI)
11 shared publications - Lorik Dumani
Trier University
3 shared publications - Lukas Malburg
Trier University
3 shared publications - Ralf Schenkel
Trier University
3 shared publications - Premtim Sahitaj
TU Berlin, DFKI, Berlin, Germany
2 shared publications - Stefan Ollinger
University of Trier
2 shared publications
Latest Publications
- 1 September 2025
- Published by Springer Nature
- p. 77-90
Numbers Don’t Lie: Hybrid Extraction and Validation of Quantitative Statements in Arguments with Semi-structured Information
- 1 September 2025
- Published by Springer Nature
- p. 77-90
Numbers Don’t Lie: Hybrid Extraction and Validation of Quantitative Statements in Arguments with Semi-structured Information
- 23 June 2025
- Published by Springer Nature
- p. 126-141
LLsiM: Large Language Models for Similarity Assessment in Case-Based Reasoning
- 23 June 2025
- Published by Springer Nature
- p. 126-141
LLsiM: Large Language Models for Similarity Assessment in Case-Based Reasoning
- 23 June 2025
- Published by Springer Nature
- p. 252-266
A Framework for Supporting the Iterative Design of CBR Applications
- 23 June 2025
- Published by Springer Nature
- p. 252-266
A Framework for Supporting the Iterative Design of CBR Applications
- 23 June 2025
- Published by Springer Nature
- p. 3-17
EXAR: A Unified Experience-Grounded Agentic Reasoning Architecture
- 23 June 2025
- Published by Springer Nature
- p. 3-17
EXAR: A Unified Experience-Grounded Agentic Reasoning Architecture
- 29 November 2024
- Published by Springer Nature
- p. 189-203
ArgueMapper Assistant: Interactive Argument Mining Using Generative Language Models
- 29 November 2024
- Published by Springer Nature
- p. 189-203
ArgueMapper Assistant: Interactive Argument Mining Using Generative Language Models
- Open Access
- 17 July 2024
- Published by Springer Nature
- p. 108-126
PolArg: Unsupervised Polarity Prediction of Arguments in Real-Time Online Conversations
The increasing usage of social networks has led to a growing number of discussions on the Internet that are a valuable source of argumentation that occurs in real time. Such conversations are often made up of a large number of participants and are characterized by a fast pace. Platforms like X/Twitter and Hacker News (HN) allow users to respond to other users’ posts, leading to a tree-like structure. Previous work focused on training supervised models on datasets obtained from debate portals like Kialo where authors provide polarity labels (i.e., support/attack) together with their posts. Such classifiers may yield suboptimal predictions for the noisier posts from X or HN, so we propose unsupervised prompting strategies for large language models instead. Our experimental evaluation found this approach to be more effective for X conversations than a model fine-tuned on Kialo debates, but less effective for HN posts (which are more technical and less argumentative). Finally, we provide an open-source application for converting discussions on these platforms into argument graphs.
- 17 July 2024
- Published by Springer Nature
- p. 108-126
Open AccessPolArg: Unsupervised Polarity Prediction of Arguments in Real-Time Online Conversations
The increasing usage of social networks has led to a growing number of discussions on the Internet that are a valuable source of argumentation that occurs in real time. Such conversations are often made up of a large number of participants and are characterized by a fast pace. Platforms like X/Twitter and Hacker News (HN) allow users to respond to other users’ posts, leading to a tree-like structure. Previous work focused on training supervised models on datasets obtained from debate portals like Kialo where authors provide polarity labels (i.e., support/attack) together with their posts. Such classifiers may yield suboptimal predictions for the noisier posts from X or HN, so we propose unsupervised prompting strategies for large language models instead. Our experimental evaluation found this approach to be more effective for X conversations than a model fine-tuned on Kialo debates, but less effective for HN posts (which are more technical and less argumentative). Finally, we provide an open-source application for converting discussions on these platforms into argument graphs.
- Open Access
- 17 July 2024
- Published by Springer Nature
- p. 352-369
ArgServices: A Microservice-Based Architecture for Argumentation Machines
Argumentation is ubiquitous, and the development of argumentation machines could greatly assist humans in managing and navigating argumentation. However, the development of such systems is hindered by the lack of common standards and suitable tools, leading to ad-hoc solutions with little reuse value. Towards a more unified approach, we present an extensible microservice-based architecture for argumentation machines. Being built on the established gRPC framework, it provides strongly typed interfaces for the following services: (i) Argument Mining, (ii) Case-Based Reasoning on Arguments, (iii) Argument Retrieval and Ranking, and (iv) Quality Assessment of Arguments. Our system is designed to be extensible, allowing for easy integration of new tasks. We demonstrate the feasibility of our architecture via a proof-of-concept implementation and provide additional supplementary resources, such as a REST API gateway. Our contributions are publicly available on GitHub under the permissive MIT license.
- 17 July 2024
- Published by Springer Nature
- p. 352-369
Open AccessArgServices: A Microservice-Based Architecture for Argumentation Machines
Argumentation is ubiquitous, and the development of argumentation machines could greatly assist humans in managing and navigating argumentation. However, the development of such systems is hindered by the lack of common standards and suitable tools, leading to ad-hoc solutions with little reuse value. Towards a more unified approach, we present an extensible microservice-based architecture for argumentation machines. Being built on the established gRPC framework, it provides strongly typed interfaces for the following services: (i) Argument Mining, (ii) Case-Based Reasoning on Arguments, (iii) Argument Retrieval and Ranking, and (iv) Quality Assessment of Arguments. Our system is designed to be extensible, allowing for easy integration of new tasks. We demonstrate the feasibility of our architecture via a proof-of-concept implementation and provide additional supplementary resources, such as a REST API gateway. Our contributions are publicly available on GitHub under the permissive MIT license.
- 24 June 2024
- Published by Springer Nature
- p. 289-304
CBRkit: An Intuitive Case-Based Reasoning Toolkit for Python
- 24 June 2024
- Published by Springer Nature
- p. 289-304
CBRkit: An Intuitive Case-Based Reasoning Toolkit for Python
- 30 July 2023
- Published by Springer Nature
- p. 263-278
Case-Based Adaptation of Argument Graphs with WordNet and Large Language Models
- 30 July 2023
- Published by Springer Nature
- p. 263-278
Case-Based Adaptation of Argument Graphs with WordNet and Large Language Models
- Open Access
- 9 June 2020
- Published by Springer Nature in Datenbank-Spektrum
- Vol. 20 (2) , 93-98
The ReCAP Project
Argumentation Machines search for arguments in natural language from information sources on the Web and reason with them on the knowledge level to actively support the deliberation and synthesis of arguments for a particular user query. The recap project is part of the Priority Program ratio and aims at novel contributions to and confluence of methods from information retrieval, knowledge representation, as well as case-based reasoning for the development of future argumentation machines. In this paper we summarise recent research results from the project. In particular, a new German corpus of 100 semantically annotated argument graphs from the domain of education politics has been created and is made available to the argumentation research community. Further, we discuss a comprehensive investigation in finding arguments and argument graphs. We introduce a probabilistic ranking framework for argument retrieval, i.e. for finding good premises for a designated claim. For finding argument graphs, we developed methods for case-based argument retrieval considering the graph structure of an argument together with textual and ontology-based similarity measures applied to claims, premises, and argument schemes.
- 9 June 2020
- Published by Springer Nature in Datenbank-Spektrum
- Vol. 20 (2) , 93-98
Open AccessThe ReCAP Project
Argumentation Machines search for arguments in natural language from information sources on the Web and reason with them on the knowledge level to actively support the deliberation and synthesis of arguments for a particular user query. The recap project is part of the Priority Program ratio and aims at novel contributions to and confluence of methods from information retrieval, knowledge representation, as well as case-based reasoning for the development of future argumentation machines. In this paper we summarise recent research results from the project. In particular, a new German corpus of 100 semantically annotated argument graphs from the domain of education politics has been created and is made available to the argumentation research community. Further, we discuss a comprehensive investigation in finding arguments and argument graphs. We introduce a probabilistic ranking framework for argument retrieval, i.e. for finding good premises for a designated claim. For finding argument graphs, we developed methods for case-based argument retrieval considering the graph structure of an argument together with textual and ontology-based similarity measures applied to claims, premises, and argument schemes.