By Topic

Computing Arguments and Attacks in Assumption-Based Argumentation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Dorian Gaertner ; Imperial College London ; Francesca Toni

Most computational frameworks for argumentation are based on abstract argumentation, which determines an argument's acceptability on the basis of its ability to counterattack all arguments attacking it. However, this view of argumentation doesn't address how to find arguments, identify attacks, and exploit premises. Assumption-based argumentation addresses these three issues. It's a refinement of abstract argumentation but remains general purpose, nonetheless. Rather than considering arguments to be a primitive concept, assumption-based argumentation defines them as backward deductions (using sets of rules in an underlying logic) supported by sets of assumptions. This approach reduces the notion of an attack against an argument to that of deduction of a contrary of an assumption.

Published in:

IEEE Intelligent Systems  (Volume:22 ,  Issue: 6 )