Skip to content

Retrieving Relations, Detecting Fallacies: A RAG Approach to Political Debate Analysis

Aug 2026 · 0 citations · 42 references
Computer Science

TL;DR

This work introduces a guided retrieval-augmented methodology for fallacy detection and classification that leverages argumentative relations of support and attack to dynamically steer the extraction of relevant documents when retrieval is argumentatively guided.

Abstract

Fallacies are arguments that employ invalid reasoning, making their automatic detection critical in sensitive contexts such as high-stakes political debates, where public opinion is shaped. Spotting a fallacious argument requires contextual knowledge beyond its pure surface text. This entails world knowledge pertaining to the subject matter under discussion, as well as knowledge of the relationships that exist between arguments within the argumentative discourse. Prior work on fallacy analysis has shown that argumentative discourse structure can beneficially improve classification performance. However, such structure is typically encoded only as static classifier features, limiting its flexibility. Building on this intuition while addressing this limitation, we introduce a guided retrieval-augmented methodology for fallacy detection and classification that leverages argumentative relations of support and attack to dynamically steer the extraction of relevant documents. We evaluate our approach on the ElecDeb60to20 benchmark across 42 retrieval configurations and 14 models, performing retrieval over a 15GB knowledge base of collected political-related documents. Our approach improves macro-F1 up to 0.864 for fallacy detection and up to 0.725 for classification over non-retrieval baselines. These results show that incorporating external knowledge significantly enhances fallacy detection and classification when retrieval is argumentatively guided.

View source

Similar papers

#artificial intelligence Preprint Aug 2026

Embedding Models for Stance-Aware Argument Retrieval

This paper introduces diagnostic word-ablation metrics to quantify this phenomenon and proposes a data-centric solution that can alleviate the observed overcorrection in stance-aware argument retrieval and demonstrates that, for sufficiently powerful models, this approach can alleviate the observed overcorrection.

Angelo Sparacino, Francesca Toni, Adam Dejl · 0 citations
#natural language process... Preprint Sep 2026

Who Argues What? Joint Argument-Entity Detection and Classification in Political Debates

DNE-ElecDeb is introduced, an entity-enriched version of the USElecDeb dataset that adds DNEs in both argumentative and non-argumentative spans and defines Debate Named Entity Recognition (DNER) as the task of detecting DNEs, andJAET is proposed, a generative framework that fine-tunes decoder-only LLMs to insert inline...

Lucio La Cava, Stefano Francesco Monea, S. Greco · 0 citations
#natural language process... Preprint Sep 2026

Mining Legal Arguments in U.S. Corporate Case Law

Legal argument mining supports passage classification, retrieval, and argument completion. This work introduces an expert-annotated dataset of 42 U.S. federal tax opinions on corporate reorganizations under I.R.C. {\S}368. To our knowledge, it is the first expert-annotated, tree-structured argument corpus for this doma...

Luis Brena, William Jurayj, Gregory Deyesu et al. · 0 citations
#small language model Conference Open access Sep 2026

Improving legal reasoning reliability of large language models through citation resolution enhancements

This project seeks to create the infrastructure needed to make legal citation in OpenJustice rigorous and transparent through various enhancements to the extraction and connection of case metadata, and fully integrating the resulting citation graph into the reranker, maximizing LLM reasoning capabilities.

Aaron Elliott · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.