Dialectic proof procedures for assumption-based, admissible argumentation

, &
Artificial Intelligence 170 (2):114-159 (2006)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2005.07.002

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,170

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

ω-Groundedness of argumentation and completeness of grounded dialectical proof procedures.Phan Minh Dung, Phan Minh Thang & Jiraporn Pooksook - forthcoming - Argument and Computation.
Argument graphs and assumption-based argumentation.Robert Craven & Francesca Toni - 2016 - Artificial Intelligence 233 (C):1-59.
A generalised framework for dispute derivations in assumption-based argumentation.Francesca Toni - 2013 - Artificial Intelligence 195 (C):1-43.
On the computational complexity of assumption-based argumentation for default reasoning.Yannis Dimopoulos, Bernhard Nebel & Francesca Toni - 2002 - Artificial Intelligence 141 (1-2):57-78.
A general framework for sound assumption-based argumentation dialogues.Xiuyi Fan & Francesca Toni - 2014 - Artificial Intelligence 216 (C):20-54.
Assumption-based argumentation for closed and consistent defeasible reasoning.Francesca Toni - 2008 - In Takashi Washio, Ken Satoh, Hideaki Takeda & Akihiro Inokuchi, New Frontiers in Artificial Intelligence. Springer. pp. 390--402.
Computational complexity of flat and generic Assumption-Based Argumentation, with and without probabilities.Kristijonas Čyras, Quentin Heinrich & Francesca Toni - 2021 - Artificial Intelligence 293 (C):103449.
On Mathematical Proving.Ioannis M. Vandoulakis & Petros Stefaneas - 2015 - Journal of Artificial General Intelligence 6 (1):130–149.
Argument construction and reinstatement in logics for defeasible reasoning.John F. Horty - 2001 - Artificial Intelligence and Law 9 (1):1-28.
Complexity-sensitive decision procedures for abstract argumentation.Wolfgang Dvořák, Matti Järvisalo, Johannes Peter Wallner & Stefan Woltran - 2014 - Artificial Intelligence 206 (C):53-78.

Analytics

Added to PP
2020-12-22

Downloads
21 (#1,105,144)

6 months
2 (#1,359,420)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Computing ideal sceptical argumentation.P. M. Dung, P. Mancarella & F. Toni - 2007 - Artificial Intelligence 171 (10-15):642-674.
A tutorial on assumption-based argumentation.Francesca Toni - 2014 - Argument and Computation 5 (1):89-117.

View all 31 citations / Add more citations

References found in this work

Defeasible Reasoning.John L. Pollock - 1987 - Cognitive Science 11 (4):481-518.
Circumscription — A Form of Non-Monotonic Reasoning.John McCarthy - 1980 - Artificial Intelligence 13 (1-2):27–39.
Semantic Considerations on nonmonotonic Logic.Robert C. Moore - 1985 - Artificial Intelligence 25 (1):75-94.
What is reasoning? What is an argument?Douglas N. Walton - 1990 - Journal of Philosophy 87 (8):399-419.

View all 14 references / Add more references