| paper | d4-conf-ijcai-2007-0172 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
The named correctness and termination results support a procedure for computing credulous acceptance, so the absence of a complexity classification alone does not disqualify them. But the proposed population interpretation has no formulation that preserves the query: attack relations and admissibility depend on the specific vertices, while aggregating by type loses that structure or requires a new semantics. No continuous population question survives for these results.
fails bit b-none — no population with multiplicity to relax
The named results support soundness, completeness, and termination properties of the proof-option search used for credulous acceptance and extension construction; the paper gives no complexity classification or runtime bound.
I can’t make an honest anchor-based positive case under your rules. The paper has numbered results about its algorithm, but none asserts that an underlying problem is in P, NP-hard, FPT, or any comparable complexity class.
The closest results are Theorem (12), proved here: every proof or refutation option yields an admissible set; and Theorem (13), also proved here: for a finite argumentation framework, every minimal admissible set containing an argument—or containing an attacker of it—induces the corresponding proof or refutation option. Corollaries (16) and (17) establish that missing proofs or refutations have no options, and that the algorithm’s partial options eventually empty out in finite frameworks. These are correctness and termination facts, not complexity classifications. The paper describes an algorithm for credulous acceptance and reports an implementation, but gives no named complexity result for that problem.
That leaves no qualifying anchor and thus no continuous problem to specify per anchor. A population of argument types with fractional admissibility might be proposed, but the paper does not establish that this preserves its problem: its objects are arguments in one attack graph, and its semantics use discrete conflict and set inclusion. Making those objects fractional would require defining a new semantics that the authors may not recognize as their question.
This does not show that no continuous mirror is possible. It means the paper supplies no named result from which I can make the required anchor-backed case.
The proponent raises no qualifying anchor, and I don’t see one in the paper. The nearest candidates are Theorems 12 and 13: they establish correctness links between proof/refutation options and admissible sets. Corollaries 16 and 17 give termination consequences for finite frameworks. None classifies the complexity of a computational problem. The paper presents an algorithm for credulous acceptance and extension enumeration, but does not prove a complexity bound for those tasks. Example 18 illustrates an exponential number of options; it does not classify the decision problem. So there is no named complexity result here to mirror.
The strongest candidate anyway is a high multiplicity version of credulous acceptance: ask whether a target argument can be accepted in a society containing many arguments of each type. But a type would need to capture the argument’s relevant attack relations. In a general attack graph, those relations are specific to individual vertices, so complete types may be unique and there is no meaningful aggregation. In a symmetric graph where many vertices really are interchangeable, their multiplicities either collapse to a finite type quotient, leaving no new mass-based question, or affect the graph’s exact attack structure. Counts alone cannot encode which arguments attack which others.
The continuum creates a further problem for the central query. Credulous acceptance asks whether a particular argument belongs to some preferred extension; admissibility requires exact conflict-freedom, defence against every attacker, and maximality by set inclusion. A diffuse argument has zero mass. If the continuous semantics ignores zero-mass exceptions, it can discard an attacker that changes the answer. If it keeps every individual attacker and preserves the distinguished target, it retains the original graph structure instead of replacing the population with a distribution. Asking whether a positive mass of arguments is accepted, or adopting almost-everywhere defence, could define coherent new questions, but would change what the paper’s algorithm computes.
That is the honest negative case: no anchor meets the requested criterion, and the best continuous reinterpretation either loses the paper’s identity-sensitive graph semantics or adds mass without changing the problem. It is not a proof that continuous argumentation can never be worthwhile; it is a strong reason to treat such a project as a new semantics rather than a mirror of this paper’s results.
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.