Broadening Label-Based Argumentation Semantics with May-Must Scales

DOI10.1007/978-3-030-44638-3_2OpenAlexW3013131911MaRDI QIDQ5098740

Takayuki Ito, Ryuta Arisaka

Publication date: 30 August 2022

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

Full work available at URL: https://arxiv.org/abs/2001.05730

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logic in computer science (03B70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weighted argument systems: basic definitions, algorithms, and complexity results
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• On the graded acceptability of arguments in abstract and instantiated argumentation
• A Hasse diagram for weighted sceptical semantics with a unique-status grounded semantics
• An Argumentation-Based Approach for Automatic Evaluation of Design Debates
• Conflict-Tolerant Semantics for Argumentation Frameworks
• An equational approach to the merging of argumentation networks
• On the Issue of Reinstatement in Argumentation
• How Agents Alter Their Beliefs After an Argumentation-Based Dialogue
• Robust semantics for argumentation frameworks
• A Generalization of Dung’s Abstract Framework for Argumentation: Arguing with Sets of Attacking Arguments
• A logic-based theory of deductive arguments

This page was built for publication: Broadening Label-Based Argumentation Semantics with May-Must Scales