Towards Fixed-Parameter Tractable Algorithms for Abstract Argumentation.¶
Dvořák, W., Pichler, Reinhard, & Woltran, S. (2011). Towards Fixed-Parameter Tractable Algorithms for Abstract Argumentation. DBAI Technical Report DBAI-TR-2011-74.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Cycle rank (digraph)
- Comparison and evidence scope — distinguishes the exact invariant, a proved bound and an application-specific consequence; graph representation, convention and proof status govern what a reported number warrants.
This sourceOriginal technical report with the worked formula construction and acceptance-hardness proof; its general self-loop convention differs from the retained one, while the selected construction is loop-free.
- Comparison and evidence scope — distinguishes the exact invariant, a proved bound and an application-specific consequence; graph representation, convention and proof status govern what a reported number warrants.
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:b99c8b442354 · see in the full table