Have You Been Convinced? A Neuro-symbolic Argumentation Reasoning Approach to Detecting Persuasiveness in ChangeMyView Discussions
Organizations: Fondazione Bruno Kessler, Trento, Italy · Universidade da Coruña, Coruña, Spain · IEGPS-CSIC, Spanish National Research Council Spain
Abstract
Argument structures represent how individual arguments interact within a discourse. However, leveraging these structures to infer meaningful knowledge remains challenging, as it requires a formal representation of how argumentative influence propagates across the structure. We propose Neuro-symbolic Argumentation Reasoning System (NARS) for performing persuasiveness detection directly from online discussions. The neural component employs retrieval-augmented iterative LLM reasoning to extract bipolar argument structures, while the symbolic component applies gradual argumentation semantics to propagate argumentative influence over the structure. Using the Webis-CMV-20 corpus, we construct CMV2BAS, a dataset of long, multi-threaded ChangeMyView discussions annotated with LLM-derived bipolar argument structures and labeled with delta events (view change vs.\ no change). We investigate whether gradual argumentation semantics can effectively detect persuasiveness, whether augmenting them with argument quality and graph-based centrality improves performance, and whether symbolic reasoning remains necessary in the presence of modern LLMs. NARS achieves F1=0.57 and AUC=0.56 under its best configuration, outperforming zero-shot Qwen3.6:27B and GPT-oss:20B. We identify support-dominant discussions and long argumentative chains as key failure modes limiting attack influence propagation. Our work demonstrates the feasibility of operationalizing formal gradual argumentation semantics over noisy real-world discourse for scalable macro-level persuasion analysis, while highlighting key challenges and directions for future research in neuro-symbolic argumentation reasoning. We release both CMV2BAS dataset and the NARS framework for public use.
Figures & tables
| Step | Configuration |
|---|---|
| S1 EDU Extraction | Qwen3:27B [ 35 ] ; one-shot, zero-thinking; temp=0.1; batch=200 sentences; max 8,192 tokens; punctuation fallback |
| S2 PAC Selection | all-MiniLM-L6-v2 [ 37 ] ; =25; sim. threshold=0.45; =10, =5 |
| S3 Relation Prediction | GPT-oss:20B (medium thinking) [ 31 ] ; batch=10 EDUs 2 sentences for context; self-consistency with temp={0.1, 0.2, 0.15 (tie-breaker)}; max 8,192 tokens; JSON structured output |
| S4 BAS Construction | via GPT-oss:20B (medium thinking); discarded : only main component containing ; synthetic : cosine-similarity repair via all-MiniLM-L6-v2 ; min. 3 nodes in final graph |
| S5 Strength Init. | UI / GI / TI / HI / Ensemble; =1.0/ =3.0; synthetic edge weight=0.7 |
| S6 Gradual Semantics | =0.5, =0.2, =0.1, =1e-6, =1,000 |
| Category | Method | Accuracy | F1 | AUC |
|---|---|---|---|---|
| Naive Baseline | Random | 0.5025 | 0.5266 | 0.5000 |
| Log. Regression | 0.5392 | 0.5635 | 0.5869 | |
| NARS (discarded); | UI | 0.5417 | 0.5165 | 0.5620 |
| GI | 0.5000 | 0.5450 | 0.4697 | |
| TI | 0.4635 | 0.4976 | 0.4638 | |
| HI | 0.4505 | 0.4548 | 0.4605 |
Computational Argumentation
Computational argumentation studies how to represent, analyze, and apply arguments and their relationships using formal and computational methods.
See all 94 papers