Debates have recently emerged as a useful methodology for agentic AI to improve performance as well as to aid explainability and user engagement. For example, LLM-empowered agents may debate internally (with themselves) and/or externally (with other agents). In many settings where debates are used, debates' outcomes and resulting outputs are determined post-hoc by external judges, often LLMs. In this paper we develop and test a novel theory of debate judgement applicable to all settings where agents engage in debates by providing pros and cons for their opinions therein. Specifically, we identify a number of formal properties that debate judgement may be required to satisfy in general, as concerns reproducibility, robustness, groundedness and explainability. Then, we explore their satisfaction formally and/or experimentally, for claim verification settings, for two specific alternative debate judgement methods: variants of the LLMs as a judge idea and formal semantics drawn from computational argumentation. We show that the two methods give similar accuracy performances but the former may lack formal guarantees that the latter brings. Overall, our study indicates argumentation semantics as an ideal candidate for principled judges in debate-driven AI.
Figures & tables
Figure 1: Example of a QBAF modelling a simple family debate about going to the zoo on Sunday. The central claim is the Topic argument; green and red nodes are pro and con arguments, respectively. Edges labelled + and − denote support and attack relations, and values denote base scores.
Figure 2: Overview of post-hoc debate judgement : n≥1 agents ( A1,…,An ) debate an input (claim) I over m≥1 time steps. At time step t∈{1,…,m} , agent Ak ( k∈{1,…,n} ) produces opinion Okt made up of explanation (pros and cons) Ekt and output (stance) ykt ; then, a judge gives a judgement (stance) J determined by a judgement method c applied to the input and O1,…,On , drawn from the debate. At each time step t , agents may contribute to a shared explanation Et , feeding into O1,…,On . At each time step , each agent sees the other agents’ opinions at the previous time step and can adjust its own opinion accordingly.
Scenario
Setting
Variant
Acc.
T-Acc.
F-Acc.
LLM as a judge
Single-turn
No anon.
None
72.20
54.22
90.04
Single-turn
No anon.
Prior
72.80
53.41
92.03
Single-turn
No anon.
Post.
74.60
57.03
92.03
Single-turn
Anon.
None
72.00
53.41
90.44
Single-turn
Anon.
Prior
74.20
57.03
91.24
Table 1: Judgement accuracy of LLM-based and semantics-based judges under different scenarios, settings and variants. We also report accuracy for T rue and F alse judgements. Overall best results are in bold .
Method
Scenario
Profile
Acc.
Δ Acc.
LLM
Single-turn
Baseline
72.80
+0.00
LLM
Single-turn
Pro +0.1 , capped
75.20
+2.40
LLM
Multi-t. private
Baseline
72.40
+0.00
LLM
Multi-t. private
Pro +0.1 , capped
74.00
+1.60
QBAF
Single-turn
Baseline
74.40
+0.00
QBAF
Single-turn
Pro +0.1 , capped
74.60
+0.20
Table 2: Profile-robustness results for semantics-as-a-judge and LLM-as-a-judge, with pro scores increased by 0.1 .
Method
Scenario
Temp. / Conserv.
Acc.
Δ Acc.
LLM
Single-turn
0.9
72.40
−0.40
LLM
Single-turn
1.0
72.80
+0.00
LLM
Single-turn
1.1
73.00
+0.20
LLM
Multi-t. private
0.9
72.60
+0.20
LLM
Multi-t. private
1.0
72.40
+0.00
LLM
Multi-t. private
1.1
72.80
+0.40
Table 3: Judge-robustness results for the QBAF-based and LLM-based judges, following changes to their parameters.
Method
Scenario
Setting
Satisfied
Rate
LLM
Single-turn
No anon.
471/500
94.20
LLM
Single-turn
Anon.
471/500
94.20
LLM
Multi-t. private
No anon.
475/500
95.00
LLM
Multi-t. private
Anon.
480/500
96.00
LLM
Multi-t. shared
No anon.
475/500
95.00
LLM
Multi-t. shared
Anon.
478/500
95.60
Table 4: Non-hallucination results for the semantics-based and LLM-based judges with prior stance scores. Rate denotes the proportion of judgements satisfying non-hallucination.
Method
Scenario
Setting
Satisfied
Rate
LLM
Single-turn
No anon.
287/316
90.82
LLM
Single-turn
Anon.
287/316
90.82
LLM
Multi-t. private
No anon.
291/316
92.09
LLM
Multi-t. private
Anon.
296/316
93.67
LLM
Multi-t. shared
No anon.
301/326
92.33
LLM
Multi-t. shared
Anon.
304/326
93.25
Table 5: Judge-unanimity results for the semantics-based and LLM-based judges. Rate denotes the proportion of judgements satisfying judge unanimity for unanimous opinions.
Method
Scenario
Score ≥
F → T
T → F
LLM
Single-turn
407/500
14
6
LLM
Multi-t. private
442/500
14
2
QBAF
Single-turn
500/500
15
0
QBAF
Multi-t. private
500/500
6
0
Table 6: Contestability results for increasing all pro scores by 0.1 . Score ≥ reports cases where the judge score after perturbation is greater than or equal to the original score.
Appendix figures & tables8 assets
Supplementary material from the paper’s appendix.
Appendix
Scenario
Temp.
Run
Acc.
T-Acc.
F-Acc.
Single-turn
1.0
1
72.40
52.21
92.43
Single-turn
1.0
2
72.60
52.21
92.83
Single-turn
1.0
3
73.60
54.62
92.43
Single-turn
0.0
1
73.00
53.01
92.83
Single-turn
0.0
2
72.60
52.21
92.83
Single-turn
0.0
3
73.20
53.41
92.83
Appendix
Table 7: Determinism results for the LLM-as-a-judge method under different temperature settings.
Scenario
Agent Order
Acc.
T-Acc.
F-Acc.
Single-turn
A1–A2–A3
72.80
53.41
92.03
Single-turn
A1–A3–A2
73.80
55.02
92.43
Single-turn
A2–A1–A3
72.80
53.01
92.43
Single-turn
A2–A3–A1
73.40
54.62
92.03
Single-turn
A3–A1–A2
73.60
54.22
92.83
Single-turn
A3–A2–A1
74.40
56.22
92.43
Appendix
Table 8: Permutation-independence results for the LLM-as-a-judge method under different agent orders.
Scenario
Setting
Variant
Acc.
T-Acc.
F-Acc.
QE Semantics-as-a-judge
Single-turn
Separate
0.5
68.40
48.59
88.05
Single-turn
Separate
Prior
75.20
63.86
86.45
Single-turn
Combined
0.5
68.40
48.59
88.05
Single-turn
Combined
Avg. Prior
73.40
56.63
90.04
Private
Separate
0.5
72.20
50.60
93.63
Appendix
Table 9: Accuracy results for QBAF-based judging.
Method
Scenario
Profile
Acc.
Δ Acc.
QBAF (DF-QuAD)
Single-turn
Baseline
74.40
+0.00
QBAF (DF-QuAD)
Single-turn
Pro +0.1 , capped
74.60
+0.20
QBAF (DF-QuAD)
Multi-t. private
Baseline
75.40
+0.00
QBAF (DF-QuAD)
Multi-t. private
Pro +0.1 , capped
75.00
−0.40
QBAF (QE)
Single-turn
Baseline
75.20
+0.00
QBAF (QE)
Single-turn
Pro +0.1 , capped
74.80
−0.40
Appendix
Table 10: Profile-robustness results for QBAF-based judging.
Method
Scenario
Conserv.
Acc.
Δ Acc.
QBAF (DF-QuAD)
Single-turn
1.0
74.40
+0.00
QBAF (DF-QuAD)
Single-turn
1.1
74.40
+0.00
QBAF (DF-QuAD)
Single-turn
1.2
74.20
−0.20
QBAF (DF-QuAD)
Multi-t. private
1.0
75.40
+0.00
QBAF (DF-QuAD)
Multi-t. private
1.1
75.40
+0.00
QBAF (DF-QuAD)
Multi-t. private
1.2
75.80
+0.40
Appendix
Table 11: Judge-robustness results for QBAF-based judging under different conservativeness settings.
Method
Scenario
Setting
Satisfied
Rate
QBAF (DF-QuAD)
Single-turn
Separate
489/500
97.80
QBAF (DF-QuAD)
Single-turn
Combined
494/500
98.80
QBAF (DF-QuAD)
Multi-t. private
Separate
494/500
98.80
QBAF (DF-QuAD)
Multi-t. private
Combined
498/500
99.60
QBAF (DF-QuAD)
Multi-t. shared
Separate
498/500
99.60
QBAF (DF-QuAD)
Multi-t. shared
Combined
498/500
99.60
Appendix
Table 12: Non-hallucination results for QBAF-based judging.
Method
Scenario
Setting
Satisfied
Rate
QBAF (DF-QuAD)
Single-turn
Separate
305/316
96.52
QBAF (DF-QuAD)
Single-turn
Combined
310/316
98.10
QBAF (DF-QuAD)
Multi-t. private
Separate
310/316
98.10
QBAF (DF-QuAD)
Multi-t. private
Combined
314/316
99.37
QBAF (DF-QuAD)
Multi-t. shared
Separate
324/326
99.39
QBAF (DF-QuAD)
Multi-t. shared
Combined
324/326
99.39
Appendix
Table 13: Judge-unanimity results for QBAF-based judging.
Method
Scenario
Score Non-decreasing
False to True
True to False
QBAF (DF-QuAD)
Single-turn
500/500
15
0
QBAF
Multi-t. private
500/500
6
0
QBAF (QE)
Single-turn
500/500
6
0
QBAF (QE)
Multi-t. private
500/500
17
0
Appendix
Table 14: Contestability results for QBAF-based judging.
Multi-agent debate systems are typically evaluated only on whether the final answer is correct, overlooking the quality of the intermediate reasoning that debate is designed to produce. This paper studies the relationship between three signals in multi-agent debate: token-level log-probability distributions over reasoning tokens, LLM-as-judge rubric scores assigned to those tokens, and final task accuracy. We examine whether internal confidence signals predict externally evaluated reasoning quality, and whether either signal aligns with task correctness, across three domains: rubric-based scoring, mathematical reasoning, and factual question answering. Our framework pairs a two-agent debate architecture -- a Constructor and an Auditor -- with an LLM-as-judge that scores each agent's reasoning along instruction following, justification quality, and evidence grounding, together with a critical-failure flag. Experiments in the rubric-scoring domain reveal a consistent four-phase confidence trajectory and a substantial role asymmetry: confidence aligns with judged reasoning quality roughly twice as strongly for the Constructor as for the Auditor, and confidence-based detection of critical reasoning failures is markedly more reliable for the Constructor (AUROC 0.804) than for the Auditor (0.634). These findings motivate the broader cross-domain investigation proposed in this paper.
Multi-agent debate, in which several LLMs exchange arguments before producing an answer, raises a basic question: does expressed disagreement reflect changes in the members' own positions? No single signal can settle this question, so we organize the analysis around five questions: (A) does the debater say it disagrees; (B) does its reply text actually argue; (C) does its own position change after each debate turn; (D) how much, quantitatively, does the position change; and (E) how do members' final positions compare with their initial ones? We evaluate two- and three-member committees on 50 curated opinion questions from GlobalOpinionQA, using same-model, same-family, and mixed-family configurations with friendly, neutral, and hostile instructions assigned at each turn. (A) Tone changes reported agreement: the share of replies reporting strong agreement is 70.7-96.3% under friendly instructions, compared with 9.5-19.3% under hostile ones, varying with model choice. (B) Self-reports broadly align with text judgments, but consistency varies by agreement level and model choice. (C) Position changes depend on the interaction: after a peer's leaning-disagree reply, members reporting strong agreement switch options more often than those reporting leaning disagreement. (D) For open-weight members, the probability of the option a member already holds stays near saturation, even after a peer's pushback, while endorsement of its earlier position text drops after a peer's argument relative to neutral filler, more for Qwen3.8-27B than Inkling. (E) The selected option is unchanged from members' initial to final positions in over 90% of comparisons in every configuration. Taken together, expressed disagreement need not translate into position revision, either within individual exchanges or over a complete debate.
Multi-agent debate has emerged as a promising approach for improving LLM reasoning on ground-truth tasks, yet current methodologies face certain structural limitations: debate tends to induce a martingale over belief trajectories, majority voting accounts for most observed gains, and LLMs exhibit confidence escalation rather than calibration across rounds. We argue that the genuine value of debate, and dialectic systems as a whole, lies not in ground-truth tasks but in defeasible domains, where every position can in principle be defeated by better reasoning. We present the Council of Hierarchical Agentic Language (CHAL), a multi-agent dialectic framework that treats defeasible argumentation as an engine for belief optimization. Each agent maintains a CHAL Belief Schema (CBS), a graph-structured belief representation with a Bayesian-inspired architecture, that facilitates belief revision through a gradient-informed dynamic mechanism by leveraging the strength of the belief's thesis as a differentiable objective. Meta-cognitive value systems spanning epistemology, logic, and ethics are elevated to configurable hyperparameters governing agent reasoning and adjudication outcomes. We provide a series of ablation experiments that demonstrate systematic and interpretable effects: the adjudicator's value system determines the debate's overall trajectories in latent belief space, council diversity refines beliefs for all participants, and the framework generalizes across broad fields. CHAL is, to our knowledge, the first framework to treat multi-agent debate as structured belief optimization over defeasible domains. Further, the auditable belief artifacts it produces establish the foundation for dedicated evaluation suites for defeasible argumentation, with broader implications for building AI systems whose reasoning and value commitments are transparent, aligned, and subject to human oversight.