An Abstract Theory of Argumentation That Accommodates Defeasible Reasoning About Preferences

DOI10.1007/978-3-540-75256-1_57zbMath1148.68530OpenAlexW1487795664MaRDI QIDQ3524975

Sanjay Modgil

Publication date: 16 September 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75256-1_57

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items

Reasoning about preferences in argumentation frameworks ⋮ RAFDivider  : a distributed algorithm for computing semantics in higher-order abstract argumentation frameworks ⋮ Modelling defeasible and prioritized support in bipolar argumentation ⋮ AFRA: argumentation framework with recursive attacks ⋮ Combining Modes of Reasoning: An Application of Abstract Argumentation ⋮ Weighted argument systems: basic definitions, algorithms, and complexity results ⋮ Meta-argumentation modelling. I: Methodology and techniques ⋮ Encompassing Attacks to Attacks in Abstract Argumentation Frameworks

Cites Work

• Unnamed Item
• Computational representation of practical argument
• An abstract, argumentation-theoretic approach to default reasoning
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• Argument-based extended logic programming with defeasible priorities
• Hierarchical Argumentation
• Persuasion in Practical Argument Using Value-based Argumentation Frameworks