Extending abstract argumentation systems theory
From MaRDI portal
Publication:1575701
DOI10.1016/S0004-3702(00)00030-8zbMath0945.68165OpenAlexW2089957402WikidataQ126838537 ScholiaQ126838537MaRDI QIDQ1575701
Giovanni Guida, Massimiliano Giacomin, Pietro Baroni
Publication date: 21 August 2000
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0004-3702(00)00030-8
Related Items (6)
Argumentation through a distributed self-stabilizing approach ⋮ Dialectical Proof Theories for the Credulous Prudent Preferred Semantics of Argumentation ⋮ SCC-recursiveness: a general schema for argumentation semantics ⋮ Self-stabilizing defeat status computation: dealing with conflict management in multi-agent systems ⋮ A general semi-structured formalism for computational argumentation: definition, properties, and examples of application ⋮ Handling controversial arguments
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A mathematical treatment of defeasible reasoning and its implementation.
- How to reason defeasibly
- Reaching agreements through argumentation: a logical model and implementation
- Justification and defeat
- An abstract, argumentation-theoretic approach to default reasoning
- Abstract argumentation systems
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
This page was built for publication: Extending abstract argumentation systems theory