Conflict-Tolerant Semantics for Argumentation Frameworks

DOI10.1007/978-3-642-33353-8_3zbMath1361.68215OpenAlexW40202455MaRDI QIDQ2915055

Ofer Arieli

Publication date: 21 September 2012

Published in: Logics in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33353-8_3

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Related Items (7)

A paraconsistent approach to deal with epistemic inconsistencies in argumentation ⋮ Shedding new light on the foundations of abstract argumentation: modularization and weak admissibility ⋮ Bipolarity in temporal argumentation frameworks ⋮ Broadening Label-Based Argumentation Semantics with May-Must Scales ⋮ Being Consistent About Inconsistency: Toward the Rational Fusing of Inconsistent Propositional Logic Bases ⋮ Conflict-free and conflict-tolerant semantics for constrained argumentation frameworks ⋮ A QBF-based formalization of abstract argumentation semantics

Cites Work

• Unnamed Item
• Skepticism relations for comparing argumentation semantics
• Computing ideal sceptical argumentation
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• A logical account of formal argumentation
• Semi-stable semantics
• On the Issue of Reinstatement in Argumentation

This page was built for publication: Conflict-Tolerant Semantics for Argumentation Frameworks