A computational argumentation framework evaluates LLM summaries of parliamentary debates by checking preservation of formal argument structures tied to contested proposals.
Argumentative Large Language Models for Explainable and Contestable Claim Verification , booktitle =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
ITA trains LLMs to generate and score arguments for ternary claim verification and uses argumentation semantics to derive faithful true/false/uncertain predictions from those structures.
citing papers explorer
-
Evaluating LLM-Driven Summarisation of Parliamentary Debates with Computational Argumentation
A computational argumentation framework evaluates LLM summaries of parliamentary debates by checking preservation of formal argument structures tied to contested proposals.
-
Neurosymbolic Learning for Inference-Time Argumentation
ITA trains LLMs to generate and score arguments for ternary claim verification and uses argumentation semantics to derive faithful true/false/uncertain predictions from those structures.