| paper | d4-conf-aaai-2016-0124 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
The numbered propositions report axiomatic properties and their relationships, not an algorithm, complexity result, or other named computational result. With no eligible anchor, there is no result of this paper to mirror over a continuous population.
fails bit a — no named computational result to mirror
No named computational result is covered; Propositions 1–8 concern axiomatic incompatibilities or which properties the semantics satisfy.
I can’t make an honest anchored case for a continuous mirror from this paper: it contains no numbered result asserting a computational-complexity or algorithmic result of the required kind.
The numbered propositions are about axiomatic properties. For example, Proposition 7, stated in this paper, says that the Matt–Toni semantics satisfies Abs, In, VP, +AB, SC, Tot, NaE and AvsFD, and fails the other listed properties. That is a result about which principles the ranking obeys, not the complexity of computing it. Propositions 2–6 similarly compare semantics against properties; Proposition 1 gives incompatibilities and implications, and Proposition 8 does the same for grounded semantics. The paper does include an algorithm for comparing tuple values on acyclic frameworks, but it does not give a numbered complexity result for that procedure.
There are tempting continuous features, but neither supplies an anchor. SAF valuations lie in \([0,1]\), and Matt–Toni uses mixed strategies; both make values or strategies continuous while the argumentation framework remains finite. The paper’s SAF comparison even sets social support equal. Those are not continuizations of the population.
One could invent a separate model with a distribution over argumentation-framework types and ask what fraction of cases rank a designated argument above another. But that aggregates rankings across frameworks rather than studying the paper’s problem of ranking arguments within a framework. It has no anchor here, and I would not expect the authors to accept it as their continuous form without substantial new modeling.
So there is no continuous problem per eligible anchor to hand to a prover. The weakest point is decisive: the paper’s contribution is explicitly comparative and axiomatic, while the requested case depends on a named computational result.
There is no named computational result here to mirror, so the proponent raises no eligible anchor. Propositions 1–8 characterize which axioms the semantics satisfy or how those axioms relate. The tuple procedure is a way to compare values on acyclic frameworks, not a stated complexity result. Asking how quickly these rankings can be computed could be a worthwhile separate question, but this paper does not make a computational claim for a continuous version to mirror.
The stronger obstacle is that the paper’s objects are arguments in one attack graph, not members of a society. Its outputs compare particular arguments, and the attack relations and paths between particular vertices determine those comparisons. Treating vertices as interchangeable types and replacing them with masses would lose that relational structure. Cloning whole disconnected frameworks would give a distribution over copies, not a new ranking problem inside a framework; treating a distribution over frameworks as the population would answer how rankings vary across cases, not the question this paper studies.
The apparent continuous features do not supply the missing bridge. SAF assigns values in \([0,1]\), and Matt–Toni uses mixed strategies, but those continuize valuations or strategies while keeping the argumentation framework finite. A population of debate participants whose support changes those valuations could be a new model; the paper fixes social support equal and makes no computational claim about that population model.
So the negative case is strongest at the programme’s gate: this comparative axiomatic paper offers no computational anchor. The broader claim that no future argumentation problem could support a sensible population model would be too strong; such a model would need a new, identifiable computational problem rather than a continuous mirror of a result in this paper.
The adversarial triple: the proponent anchors on up to three named results; the opponent sees that case and must defeat every anchor; the judge decides which case convinced it. These are the pipeline’s own outputs, generated by tools/triple_run.py — no human edited them. The paper’s own text is not reproduced here beyond the quoted statement above.