Jump to ContentJump to Main Navigation
Elements of Argumentation$
Users without a subscription are not able to see the full content.

Philippe Besnard and Anthony Hunter

Print publication date: 2008

Print ISBN-13: 9780262026437

Published to MIT Press Scholarship Online: August 2013

DOI: 10.7551/mitpress/9780262026437.001.0001

Show Summary Details
Page of

PRINTED FROM MIT PRESS SCHOLARSHIP ONLINE (www.mitpress.universitypressscholarship.com). (c) Copyright The MIT Press, 2021. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in MITSO for personal use.date: 27 September 2021

Algorithms for Argumentation

Algorithms for Argumentation

(p.157) 7 Algorithms for Argumentation
Elements of Argumentation

Philippe Besnard

Anthony Hunter

The MIT Press

This chapter, which considers algorithms for constructing arguments and argument trees, starts by introducing some basic algorithms for argumentation. These simple algorithms are for finding supports for an argument, for constructing an argument tree for a given subject, and for constructing an argument tree for a given root argument. They are naive in the sense that no techniques or strategies are considered for addressing the computational complexity and undecidability issues arising from using classical propositional or first-order logic. To address the computational viability problems, three approaches are proposed: (1) compilation of a knowledgebase, based on minimal inconsistent subsets of the knowledgebase; (2) construction of contours of a knowledgebase, a form of lemma generation; and (3) construction of approximate argument trees composed of approximate arguments, where each approximate argument is obtained as a relaxation of one or more of the entailment, consistency, and minimality conditions required for an argument.

Keywords:   argument trees, argument compilation, argument contouring, approximate arguments

MIT Press Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs, and if you can't find the answer there, please contact us.