资源分类
》 资源 》论文》On the Complexity of Enumerating the Extensions of Abstract Argumentation Frameworks

On the Complexity of Enumerating the Extensions of Abstract Argumentation Frameworks

2019-10-29 | |  39 |   35 |   0
Abstract Several computational problems of abstract argumentation frameworks (AFs) such as skeptical and credulous reasoning, existence of a non-empty extension, verification, etc. have been thoroughly analyzed for various semantics. In contrast, the enumeration problem of AFs (i.e., the problem of computing all extensions according to some semantics) has been left unexplored so far. The goal of this paper is to fill this gap. We thus investigate the enumeration complexity of AFs for a large collection of semantics and, in addition, consider the most common structural restrictions on AFs

上一篇：On Neighborhood Singleton Consistencies

下一篇：Ontology-Mediated Query Answering for Key-Value Stores

用户评价
全部评价

热门资源

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...