| paper | d4-conf-ijcai-2019-0033 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
Neither case identifies a numbered computational result in this paper: Definitions 1–6 define graphs and semantics, while the classifications are conceptual and the computational studies cited belong to other works. Bit (a) therefore fails before a participant-mass model could anchor a mirror; that would introduce a new population-level problem.
fails bit a — no named computational result to mirror
The paper defines argumentation graphs and semantics and classifies them by outcome and goal; it states no named computational result to mirror.
This paper contains no named computational result to anchor a continuous mirror. It has Definitions 1–6 and an unnumbered classification of semantics, but no numbered Theorem, Lemma, Corollary, or Proposition asserting a complexity or algorithmic result. The computational work it discusses belongs to cited papers, not to this one.
The most tempting scenario is a large online debate platform, with mass representing the fraction of participants who make arguments of a given kind. But the paper’s objects are arguments and their attack graph, not the participants; its main contribution is a conceptual classification by outcomes and goals. Turning that into a population-level complexity problem would add a new question rather than mirror a named result here. So I can’t make a valid anchored positive case for this paper.
There is no computational result in this paper to mirror. It is a survey that defines argumentation graphs and three kinds of semantics, then classifies those semantics by their outputs and goals. Its equations and examples specify evaluations; they do not establish complexity bounds or algorithms. The computational results one might look to belong to the cited papers, not to this one. That is a decisive obstacle to an anchored mirror here.
The strongest plausible scenario is a large online debate platform. But a population of participants is not the paper’s object: its nodes are arguments, and its semantics depend on how those arguments attack one another. Grouping many participants who make similar arguments might yield masses, but it does not by itself preserve the attack graph or its coalitions. A model that supplied those structures could support new computational questions about population-scale argumentation, but those would be new questions, not continuous versions of a result in this paper. The paper’s discussion of human studies could likewise motivate crowd-level empirical work, but not a computational result to continuize.
The case is strong as a verdict on this paper, though not a proof that no worthwhile continuous argumentation model could ever be devised. The proponent raised no named result or continuous question, and none in the text supplies the missing computational anchor.
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.