| paper | d4-journals-jair-2014-0031 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
Algorithm 9 presents an enumerator, but the paper has no qualifying numbered theorem, lemma, corollary, or proposition to anchor a computational mirror. The proposed extension-profile task also aggregates outputs from separate AFRA instances rather than a population within the paper’s problem.
fails bit a — no named computational result to mirror
The profile task batches independent AFRA instances, so it adds an aggregate reporting task rather than continuing the paper’s enumeration problem; the proponent acknowledges this concern but does not resolve it.
fatal: True
The proposed profile lift concerns only Algorithm 9’s stable semantics for AFRA; it leaves the other semantics and the experimental comparisons untouched.
The paper contains no numbered Theorem, Lemma, Corollary, or Proposition asserting a complexity classification. It does contain named computational contributions: numbered algorithms, implementation results, and an unnumbered statement that the grounded extension can be built in polynomial time. So there is no anchor that meets your specified form. The strongest available candidate is Algorithm 9, but it is a numbered algorithm, not a complexity theorem.
Algorithm 9, developed in this paper, enumerates every stable extension of an AFRA, including frameworks with attacks on attacks; ordinary AFs are a special case. A stable extension is a conflict-free subset of arguments and attacks that defeats every element outside it. The algorithm labels both arguments and attacks, branches over candidate attacks, and reports the IN-labeled elements when the labeling meets its conditions. The paper omits the correctness proof, saying it follows from the earlier proof for preferred semantics. Its experiments report practical running times, not a complexity bound.
The strongest mirror I can make from that result is AFRA Stable-Extension Profile Enumeration. Consider a very large collection of independent argumentation units, such as repeated case-review or moderation deliberations. A unit’s type \(t\) is its complete AFRA template \(H_t=(A_t,R_t)\), including its arguments and recursive attacks. The society is given by rational masses \(\mu_t>0\), summing to \(1\), with many units but relatively few distinct templates. Each unit must receive one of its template’s stable extensions. Let \(\mathcal S_t\) be the stable extensions of \(H_t\), and let \(x_{t,E}\) be the fraction of the whole population of type \(t\) assigned extension \(E\). The problem is to represent exactly all achievable extension-frequency profiles:
\[
P(H,\mu)=\left\{x\ge 0:\ \sum_{E\in\mathcal S_t}x_{t,E}=\mu_t\text{ for every }t\right\}.
\]
A solution gives each \(\mathcal S_t\) and this polytope description. There is no numerical objective: the task is to enumerate the possible aggregate outcomes of the stable-extension choices.
This is an exact high-multiplicity lift of stable-extension enumeration on disjoint unions of AFRA components. In the discrete version, each module gets an integral stable extension; grouping identical modules gives extension counts. In the continuous version, those counts become masses, so a type can be split among its stable extensions. The semantics inside every module remain the paper’s semantics. A scenario with many repeated modules and few templates is plausible, and the resulting question is one the authors could recognize as a mass-aggregated form of their enumeration problem. It covers Algorithm 9’s stable-semantics result for AFRA, not the paper’s other semantics or its performance comparisons.
I expect hardness to transfer. With one type of mass \(1\), the profile problem has a feasible solution exactly when its AFRA has a stable extension. Since ordinary AFs are a special case, the usual NP-completeness of stable-extension existence already persists in that subcase. The hard combinatorics are in the argument and attack structure, not in population multiplicity. Natural follow-up questions include output-sensitive enumeration, and parameterizations by component size, treewidth, or recursion depth.
The soft spot is the choice of population unit. This mirror treats repeated deliberation modules as the population atoms; the paper itself studies one framework at a time, not a society of such units. A referee might regard it as a batch-compressed application of Algorithm 9 rather than a new continuous argumentation problem. That is a narrower case than a continuum of individual arguments, but the latter would need new mass-based semantics and would no longer preserve the paper’s stable-extension question.
Algorithm 9 is the paper’s strongest possible anchor, but it is not a complexity classification: the paper gives no theorem establishing a worst-case bound for stable-extension enumeration. It presents an algorithm and bounded experiments. That leaves little of the kind of computational landscape ChoCo is charting to mirror.
Taking Algorithm 9 as an anchor anyway, the proposed profile problem is just a batch wrapper around it. For each template \(H_t\), let \(\mathcal S_t\) be its stable extensions. The achievable profiles are the product of scaled simplices, \(\prod_t \mu_t\Delta(\mathcal S_t)\). Computing them means enumerating each \(\mathcal S_t\) with Algorithm 9; the rest follows directly. The mass split describes different copies of a framework taking different extensions. It does not describe a fractional extension of any one framework, or a collective choice that couples the copies. Repeated independent deliberations are imaginable, but their extension frequencies are a new reporting task, not the paper’s task of enumerating the extensions of one argumentation framework. The same issue applies to the other semantics in the paper; for grounded semantics, which has a unique extension, the profile is simply determined.
A closer attempt to continuize the framework itself fares no better as a mirror. Arguments and attacks are the vertices and relations whose identities and links define the semantics. Replacing them with masses requires a new account of how conflict, defense, and maximality work on those masses. That may be a worthwhile project in its own right, but it changes the object being computed rather than giving the paper’s extension-enumeration result a population interpretation.
The negative case is not airtight: a programme that values aggregate reports over large batches of independent frameworks could choose to study the profile problem. But that is the anchor’s weakness too: it obtains a continuous society by adding a population of separate problem instances, while the paper itself contains no population-level computational question.
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.