Shedding new light on the foundations of abstract argumentation: modularization and weak admissibility
From MaRDI portal
Publication:2163881
DOI10.1016/j.artint.2022.103742OpenAlexW4281763426MaRDI QIDQ2163881
Ringo Baumann, Gerhard Brewka, Markus Ulbricht
Publication date: 11 August 2022
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2022.103742
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Normal and strong expansion equivalence for argumentation frameworks
- Characterizing strong equivalence for argumentation frameworks
- Weighted argument systems: basic definitions, algorithms, and complexity results
- Complexity of semi-stable and stage semantics in argumentation frameworks
- Two approaches to the problems of self-attacking arguments and general odd-length cycles of attack
- Characteristics of multiple viewpoints in abstract argumentation
- On principle-based evaluation of extension-based argumentation semantics
- A general semi-structured formalism for computational argumentation: definition, properties, and examples of application
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- An abstract, logical approach to characterizing strong equivalence in non-monotonic knowledge representation formalisms
- Strong explanations for nonmonotonic reasoning
- A logical account of formal argumentation
- Preprocessing argumentation frameworks via replacement patterns
- SCC-recursiveness: a general schema for argumentation semantics
- Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach
- New weak admissibility semantics for abstract argumentation
- The cf2 argumentation semantics revisited
- On the semantics of abstract argumentation
- Conflict-Tolerant Semantics for Argumentation Frameworks
- Stage semantics and the SCC-recursive schema for argumentation semantics
- The role of self-attacking arguments in characterizations of equivalence notions
- Splitting an Argumentation Framework
- On the Intertranslatability of Argumentation Semantics
- Using Graph Convolutional Networks for Approximate Reasoning with Abstract Argumentation Frameworks: A Feasibility Study
- Robust semantics for argumentation frameworks
- The equivalence zoo for Dung-style semantics
- Recursion in Abstract Argumentation is Hard --- On the Complexity of Semantics Based on Weak Admissibility
- A Principle-Based Analysis of Weakly Admissible Semantics
- Infinite Argumentation Frameworks
- If Nothing Is Accepted -- Repairing Argumentation Frameworks
- Abductive Logic Programming
- Logic Programming and Nonmonotonic Reasoning
- Strongly equivalent logic programs
This page was built for publication: Shedding new light on the foundations of abstract argumentation: modularization and weak admissibility
