CONCAP in Claim-Based Argumentation

• The paper establishes that deciding concurrence for well-formed CAFs under naive semantics is coNP-complete via a reduction from UNSAT.
• CONCAP is defined as the condition where the inherited claim-based and claim-level naive extensions coincide, ensuring all claim sets are pairwise incomparable.
• The study highlights that well-formedness alone does not simplify computational complexity, suggesting SAT or ILP-based heuristics for practical implementations.

Searching arXiv for the specified paper and closely related work on claim-based semantics and concurrence in CAFs. CONCAP denotes the concurrence problem for claim-based semantics in well-formed claim-based argumentation frameworks (CAFs) under naive semantics. In this setting, concurrence means that the inherited claim-based semantics and the claim-level semantics yield exactly the same claim-based extensions. The note “Concurrence for well-formed CAFs: Naive Semantics” establishes that deciding this property remains computationally hard even under well-formedness, showing that the problem is coNP-hard and, together with the inherited upper bound, coNP-complete (Kiesel et al., 2021).

1. Formal setting

An abstract argumentation framework (AF) is a directed graph $F = (A, R)$ with $A \subseteq U$ and $R \subseteq A \times A$, where $U$ is a fixed universe of arguments. For $a \in A$, the set of outgoing attacks is denoted by

$a_F^+ := \{ b \in A \mid (a, b) \in R \}.$

A set $E \subseteq A$ is conflict-free in $F$ iff there are no $a, b \in E$ with $(a, b) \in R$. Writing $A \subseteq U$0 for the family of conflict-free sets, naive semantics returns the $A \subseteq U$1-maximal conflict-free sets:

$A \subseteq U$2

A claim-augmented argumentation framework is a triple $A \subseteq U$3, where $A \subseteq U$4 is an AF and $A \subseteq U$5 maps each argument to a claim in a claim set $A \subseteq U$6. This map extends to sets by

$A \subseteq U$7

for $A \subseteq U$8 (Kiesel et al., 2021).

A CAF $A \subseteq U$9 is well-formed iff arguments with the same claim have identical sets of attacked arguments:

$R \subseteq A \times A$0

Equivalently, all arguments labeled by the same claim are indistinguishable with respect to outgoing attacks. This restriction is central to CONCAP because it enforces claim-coherent attack behavior without collapsing the framework to the claim level (Kiesel et al., 2021).

2. Claim-based naive semantics and concurrence

For an AF semantics $R \subseteq A \times A$1, the inherited claim-based semantics is

$R \subseteq A \times A$2

Specializing to naive semantics, the inherited claim-based extensions are

$R \subseteq A \times A$3

Claim-level naive semantics is defined through an induced claim-level attack relation $R \subseteq A \times A$4 on claims:

$R \subseteq A \times A$5

A set of claims $R \subseteq A \times A$6 is claim-conflict-free iff no $R \subseteq A \times A$7 have $R \subseteq A \times A$8. Writing $R \subseteq A \times A$9 for all claim-conflict-free sets, the claim-level naive semantics is

$U$0

It is known that $U$1. Concurrence under naive semantics is therefore the condition

$U$2

For well-formed CAFs, CONCAP asks whether this equality holds. Formally, the decision problem is

$U$3

A central characterization reused in the note states that, for every CAF $U$4,

$U$5

if and only if $U$6 is incomparable, meaning that for any distinct $U$7, neither $U$8 nor $U$9 holds (Kiesel et al., 2021). In effect, concurrence under naive semantics reduces to an antichain condition on inherited claim sets.

3. Decision problem and complexity classification

The paper studies the problem:

Given a well-formed CAF $a \in A$0, decide whether $a \in A$1.

By the incomparability characterization, this is equivalent to deciding whether $a \in A$2 is incomparable. The note proves that $a \in A$3 is coNP-complete (Kiesel et al., 2021).

The upper bound follows from the known complexity of concurrence for general CAFs under naive semantics. Since well-formed CAFs form a subclass, membership in coNP is inherited. Concretely, the complement can be decided in NP by guessing two argument-level naive extensions $a \in A$4 and checking whether $a \in A$5. Verifying $a \in A$6 is polynomial: first check conflict-freeness, and then for each $a \in A$7 verify that $a \in A$8 is not conflict-free. This gives an NP witness for non-concurrence and places the complement in NP (Kiesel et al., 2021).

The lower bound is the substantive contribution of the note. It gives a many-one reduction from UNSAT to $a \in A$9, establishing coNP-hardness even when the input is restricted to well-formed CAFs. Together with the upper bound, this yields coNP-completeness. The result resolves an open problem left by Dvořák et al. (2021), namely whether well-formedness reduces the complexity of concurrence under naive semantics (Kiesel et al., 2021).

4. Reduction from UNSAT

The source problem is UNSAT, the set of propositional CNF formulas that are not satisfiable. Given a CNF formula $a_F^+ := \{ b \in A \mid (a, b) \in R \}.$0 over variables $a_F^+ := \{ b \in A \mid (a, b) \in R \}.$1 with clauses $a_F^+ := \{ b \in A \mid (a, b) \in R \}.$2, assuming that $a_F^+ := \{ b \in A \mid (a, b) \in R \}.$3 has no tautological clause, the reduction constructs a well-formed CAF $a_F^+ := \{ b \in A \mid (a, b) \in R \}.$4 as follows:

• Arguments:

$a_F^+ := \{ b \in A \mid (a, b) \in R \}.$5

where $a_F^+ := \{ b \in A \mid (a, b) \in R \}.$6.

• Attack relation:

$a_F^+ := \{ b \in A \mid (a, b) \in R \}.$7

$a_F^+ := \{ b \in A \mid (a, b) \in R \}.$8

• Claim labeling:

$a_F^+ := \{ b \in A \mid (a, b) \in R \}.$9

Well-formedness holds because the only pair of arguments with the same claim is $E \subseteq A$0 and $E \subseteq A$1, and both have no outgoing attacks, so

$E \subseteq A$2

All other arguments have distinct claims, so the well-formedness condition is vacuous for them (Kiesel et al., 2021).

The reduction is driven by a small gadget $E \subseteq A$3 with $E \subseteq A$4. At the argument level, this gadget can generate two incompatible choices: include $E \subseteq A$5 and exclude $E \subseteq A$6, or exclude $E \subseteq A$7 and include $E \subseteq A$8. The clause–literal part of the construction ensures that excluding $E \subseteq A$9 without introducing clauses is possible iff $F$0 is satisfiable. This mechanism creates, in the satisfiable case, two naive extensions whose claim sets are strictly ordered by inclusion, which violates incomparability and therefore concurrence (Kiesel et al., 2021).

5. Satisfiable and unsatisfiable cases

If $F$1 is satisfiable with a model $F$2, define

$F$3

and

$F$4

Then $F$5, and their claim sets satisfy

$F$6

$F$7

so that

$F$8

Hence $F$9 is not incomparable, implying $a, b \in E$0; the framework is not concurrent (Kiesel et al., 2021).

The proof sketch is direct. Both sets are conflict-free because each variable contributes exactly one of $a, b \in E$1 or $a, b \in E$2, avoiding the mutual attacks between literals, and every clause is attacked by some literal selected according to $a, b \in E$3. Moreover, $a, b \in E$4 cannot be added to $a, b \in E$5 because it conflicts with $a, b \in E$6, while $a, b \in E$7 cannot be added to $a, b \in E$8 because it conflicts with $a, b \in E$9. This establishes maximality among conflict-free sets.

If $(a, b) \in R$0 is unsatisfiable, then $(a, b) \in R$1 is incomparable, and therefore

$(a, b) \in R$2

The paper’s proof sketch distinguishes extensions containing $(a, b) \in R$3 from those not containing it. If $(a, b) \in R$4, then no clause argument can be in $(a, b) \in R$5, because each clause attacks $(a, b) \in R$6, and maximality forces $(a, b) \in R$7 to contain exactly one of $(a, b) \in R$8 or $(a, b) \in R$9 for each variable and also $A \subseteq U$00. If $A \subseteq U$01, then $A \subseteq U$02 must contain a clause $A \subseteq U$03; otherwise $A \subseteq U$04 could be added. In that case, the presence of a clause claim prevents strict inclusion with extensions containing $A \subseteq U$05. Altogether, all claim sets in $A \subseteq U$06 are pairwise incomparable (Kiesel et al., 2021).

Combining the two directions yields the theorem:

$A \subseteq U$07

This establishes coNP-hardness by polynomial reduction from UNSAT.

6. Example, significance, and boundaries

The note includes an illustrative CNF formula with variables $A \subseteq U$08 and clauses

$A \subseteq U$09

Building the CAF by the reduction and taking the model $A \subseteq U$10 with $A \subseteq U$11 false yields two naive extensions:

$A \subseteq U$12

$A \subseteq U$13

Their claim sets are

$A \subseteq U$14

$A \subseteq U$15

hence $A \subseteq U$16. This witnesses non-concurrence in the satisfiable case (Kiesel et al., 2021).

The significance of the result is primarily negative but precise. Well-formedness is a natural restriction: it guarantees that arguments sharing a claim have identical outgoing attacks. One might expect this to simplify reasoning about concurrence. The paper shows that it does not. The complexity remains coNP-complete, matching the status already known for general CAFs under naive semantics (Kiesel et al., 2021).

The note does not identify any tractable subclasses of well-formed CAFs for which CONCAP under naive semantics becomes polynomial. It also does not address other semantics such as grounded, preferred, or stable for well-formed CAFs. A plausible implication is that further tractability results, if they exist, must rely on additional structural restrictions beyond well-formedness alone.

7. Algorithmic implications and open directions

From an algorithmic perspective, the coNP characterization immediately yields an NP procedure for the complement: guess $A \subseteq U$17 and accept if $A \subseteq U$18. This suggests practical SAT or ILP encodings for searching for two naive extensions whose claim sets are strictly ordered. By contrast, explicitly computing all of $A \subseteq U$19 and then checking incomparability may be exponential because the number of naive extensions can be exponential (Kiesel et al., 2021).

The note also discusses a possible role for heuristics. One can search for “claim witnesses” whose difference resembles the reduction gadget, or exploit well-formedness to compress a framework by merging arguments with identical claim and out-neighborhood. This suggests implementation strategies, but the paper does not present a tractability theorem or a complete algorithmic framework for such cases (Kiesel et al., 2021).

In claim-based reasoning more broadly, concurrence is attractive because it guarantees consistency across claim-based lifting variants: inherited and claim-level selections coincide. This removes one source of semantic ambiguity in tool design. The complexity result shows, however, that verifying this agreement is computationally intractable in the worst case, even under a natural coherence restriction. The paper therefore settles a specific open question while leaving the broader boundary between tractable and intractable cases unresolved (Kiesel et al., 2021).