Switch to: References

Add citations

You must login to add citations.
  1. Revisiting initial sets in abstract argumentation.Matthias Thimm - 2022 - Argument and Computation 13 (3):325-360.
    We revisit the notion of initial sets by Xu and Cayrol 2016), i. e., non-empty minimal admissible sets in abstract argumentation frameworks. Initial sets are a simple concept for analysing conflicts in an abstract argumentation framework and to explain why certain arguments can be accepted. We contribute with new insights on the structure of initial sets and devise a simple non-deterministic construction principle for any admissible set, based on iterative selection of initial sets of the original framework and its induced (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Decidability in argumentation semantics.Paul E. Dunne - forthcoming - Argument and Computation:1-14.
    Much of the formal study of algorithmic concerns with respect to semantics for abstract argumentation frameworks has focused on the issue of computational complexity. In contrast matters regarding computability have been largely neglected. Recent trends in semantics have, however, started to concentrate not so much on the formulation of novel semantics but more on identifying common properties: for example, from basic ideas such as conflict-freeness through to quite sophisticated ideas such as serializability. The aim of this paper is to look (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
    		•