Toward incremental computation of argumentation semantics: a decomposition-based approach (Q360248): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10472-013-9364-8 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: ASPARTIX / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10472-013-9364-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1992259854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On principle-based evaluation of extension-based argumentation semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Argumentation in artificial intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational properties of argument systems satisfying graph-theoretic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic and Quantitative Approaches to Reasoning with Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards fixed-parameter tractable algorithms for abstract argumentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Decision Problems Related to the Preferred Semantics for Argumentation Frameworks / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Computing Semi-stable Semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dialectic proof procedures for assumption-based, admissible argumentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing ideal sceptical argumentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preferred extensions as stable models / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the merging of Dung's argumentation systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Issue of Reinstatement in Argumentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and complexity results for persuasive argumentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: SCC-recursiveness: a general schema for argumentation semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust semantics for argumentation frameworks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logical account of formal argumentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamics of argumentation systems: a division-based method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10472-013-9364-8 / rank
 
Normal rank

Latest revision as of 15:22, 9 December 2024

scientific article
Language Label Description Also known as
English
Toward incremental computation of argumentation semantics: a decomposition-based approach
scientific article

    Statements

    Toward incremental computation of argumentation semantics: a decomposition-based approach (English)
    0 references
    0 references
    26 August 2013
    0 references
    argumentation semantics
    0 references
    computational complexity
    0 references
    local tractability
    0 references
    abstract argumentation framework
    0 references
    labelling-based computation
    0 references

    Identifiers