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 条
  • [21] Probabilistic Reasoning with Abstract Argumentation Frameworks
    Hunter, Anthony
    Thimm, Matthias
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2017, 59 : 565 - 611
  • [22] Dialogue Games for Argumentation Frameworks with Necessities
    Nouioua, Farid
    Boutouhami, Sara
    SYMBOLIC AND QUANTITATIVE APPROACHES TO REASONING WITH UNCERTAINTY, ECSQARU 2015, 2015, 9161 : 72 - 82
  • [23] Incremental Computation in Dynamic Argumentation Frameworks
    Alfano, Gianvincenzo
    Greco, Sergio
    Parisi, Francesco
    IEEE INTELLIGENT SYSTEMS, 2021, 36 (06) : 80 - 86
  • [24] HANDLING PREFERENCES IN ARGUMENTATION FRAMEWORKS WITH NECESSITIES
    Boudhar, Imane
    Nouioua, Farid
    Risch, Vincent
    ICAART: PROCEEDINGS OF THE 4TH INTERNATIONAL CONFERENCE ON AGENTS AND ARTIFICIAL INTELLIGENCE, VOL 1, 2012, : 340 - 345
  • [25] Valid attacks in argumentation frameworks with recursive attacks
    C. Cayrol
    J. Fandinno
    L. Fariñas del Cerro
    M.-C. Lagasquie-Schiex
    Annals of Mathematics and Artificial Intelligence, 2021, 89 : 53 - 101
  • [26] Preprocessing Argumentation Frameworks via Replacement Patterns
    Dvorak, Wolfgang
    Jarvisalo, Matti
    Linsbichler, Thomas
    Niskanen, Andreas
    Woltran, Stefan
    LOGICS IN ARTIFICIAL INTELLIGENCE, JELIA 2019, 2019, 11468 : 116 - 132
  • [27] Normal and strong expansion equivalence for argumentation frameworks
    Baumann, Ringo
    ARTIFICIAL INTELLIGENCE, 2012, 193 : 18 - 44
  • [28] On Instantiating Generalised Properties of Gradual Argumentation Frameworks
    Rago, Antonio
    Baroni, Pietro
    Toni, Francesca
    SCALABLE UNCERTAINTY MANAGEMENT (SUM 2018), 2018, 11142 : 243 - 259
  • [29] Valid attacks in argumentation frameworks with recursive attacks
    Cayrol, C.
    Fandinno, J.
    del Cerro, L. Farinas
    Lagasquie-Schiex, M-C
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2021, 89 (1-2) : 53 - 101
  • [30] Abstract argumentation frameworks with strong and weak constraints ☆
    Alfano, Gianvincenzo
    Greco, Sergio
    Mandaglio, Domenico
    Parisi, Francesco
    Trubitsyna, Irina
    ARTIFICIAL INTELLIGENCE, 2024, 336