On the computational complexity of assumption-based argumentation for default reasoning

, &
Artificial Intelligence 141 (1-2):57-78 (2002)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/s0004-3702(02)00245-x

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,748

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

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.
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.
An abstract, argumentation-theoretic approach to default reasoning.A. Bondarenko, P. M. Dung, R. A. Kowalski & F. Toni - 1997 - Artificial Intelligence 93 (1-2):63-101.
Default reasoning from conditional knowledge bases: Complexity and tractable cases.Thomas Eiter & Thomas Lukasiewicz - 2000 - Artificial Intelligence 124 (2):169-241.
Computational complexity of terminological reasoning in BACK.Bernhard Nebel - 1988 - Artificial Intelligence 34 (3):371-383.
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.
Dialectic proof procedures for assumption-based, admissible argumentation.P. M. Dung, R. A. Kowalski & F. Toni - 2006 - Artificial Intelligence 170 (2):114-159.
A general framework for sound assumption-based argumentation dialogues.Xiuyi Fan & Francesca Toni - 2014 - Artificial Intelligence 216 (C):20-54.
An approach to default reasoning based on a first-order conditional logic: Revised report.James P. Delgrande - 1988 - Artificial Intelligence 36 (1):63-90.

Analytics

Added to PP
2020-12-22

Downloads
28 (#865,834)

6 months
6 (#683,963)

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 19 citations / Add more citations

References found in this work

A logic for default reasoning.Ray Reiter - 1980 - Artificial Intelligence 13 (1-2):81-137.
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.
A logical framework for default reasoning.David Poole - 1988 - Artificial Intelligence 36 (1):27-47.

View all 6 references / Add more references