If Nothing Is Accepted - Repairing Argumentation Frameworks

被引:0
作者
Baumann, Ringo [1 ]
Ulbricht, Markus [1 ]
机构
[1] Univ Leipzig, Dept Comp Sci, Leipzig, Germany
关键词
MINIMAL UNSATISFIABLE SUBSETS; ABSTRACT ARGUMENTATION; ABDUCTIVE FRAMEWORK; INCONSISTENCY; ALGORITHMS; DIAGNOSIS;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Conflicting information in an agent's knowledge base may lead to a semantical defect, that is, a situation where it is impossible to draw any plausible conclusion. Finding out the reasons for the observed inconsistency (so-called diagnoses) and/or restoring consistency in a certain minimal way (so-called repairs) are frequently occurring issues in knowledge representation and reasoning. In this article we provide a series of first results for these problems in the context of abstract argumentation theory regarding the two most important reasoning modes, namely credulous as well as sceptical acceptance. Our analysis includes the following problems regarding minimal repairs/diagnoses: existence, verification, computation of one and enumeration of all solutions. The latter problem is tackled with a version of the so-called hitting set duality first introduced by Raymond Reiter in 1987. It turns out that grounded semantics plays an outstanding role not only in terms of complexity, but also as a useful tool to reduce the search space for diagnoses regarding other semantics.
引用
收藏
页码:1099 / 1145
页数:47
相关论文
共 50 条
  • [41] On the Semantics of Abstract Argumentation Frameworks: A Logic Programming Approach
    Alfano, Gianvincenzo
    Greco, Sergio
    Parisi, Francesco
    Trubitsyna, Irina
    THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2020, 20 (05) : 703 - 718
  • [42] Semantics Hierarchy in Preference-Based Argumentation Frameworks
    Silva, Rafael
    Sa, Samy
    Alcantara, Joao
    COMPUTATIONAL MODELS OF ARGUMENT (COMMA 2020), 2020, 326 : 339 - 346
  • [43] Continuum Argumentation Frameworks from Cooperative Game Theory
    Young, Anthony P.
    Kohan Marzagao, David
    Murphy, Josh
    COMPUTATIONAL MODELS OF ARGUMENT (COMMA 2020), 2020, 326 : 403 - 410
  • [44] On Scaling the Enumeration of the Preferred Extensions of Abstract Argumentation Frameworks
    Alfano, Gianvincenzo
    Greco, Sergio
    Parisi, Francesco
    SAC '19: PROCEEDINGS OF THE 34TH ACM/SIGAPP SYMPOSIUM ON APPLIED COMPUTING, 2019, : 1147 - 1153
  • [45] Argumentation Frameworks with Strong and Weak Constraints: Semantics and Complexity
    Alfano, Gianvincenzo
    Greco, Sergio
    Parisi, Francesco
    Trubitsyna, Irina
    THIRTY-FIFTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THIRTY-THIRD CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE AND THE ELEVENTH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2021, 35 : 6175 - 6184
  • [46] Incremental Computation of Deterministic Extensions for Dynamic Argumentation Frameworks
    Greco, Sergio
    Parisi, Francesco
    LOGICS IN ARTIFICIAL INTELLIGENCE, (JELIA 2016), 2016, 10021 : 288 - 304
  • [47] On the preferred extensions of argumentation frameworks: Bijections with naive sets
    Elaroussi, Mohammed
    Nourine, Lhouari
    Radjef, Mohammed Said
    Vilmin, Simon
    INFORMATION PROCESSING LETTERS, 2023, 181
  • [48] AGM Meets Abstract Argumentation: Contraction for Dung Frameworks
    Baumann, Ringo
    Linker, Felix
    LOGICS IN ARTIFICIAL INTELLIGENCE, JELIA 2019, 2019, 11468 : 41 - 57
  • [49] On the Acceptability Semantics of Argumentation Frameworks with Recursive Attack and Support
    Cohen, Andrea
    Gottifredi, Sebastian
    Garcia, Alejandro J.
    Simari, Guillermo R.
    COMPUTATIONAL MODELS OF ARGUMENT, 2016, 287 : 231 - 242
  • [50] On Acceptability in Abstract Argumentation Frameworks with an Extended Defeat Relation
    Martinez, Diego C.
    Garcia, Alejandro J.
    Simari, Guillermo R.
    COMPUTATIONAL MODELS OF ARGUMENT, 2006, 144 : 273 - 278