On the computational complexity of assumption-based argumentation for default reasoning
- 31 October 2002
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 141 (1-2), 57-78
- https://doi.org/10.1016/s0004-3702(02)00245-x
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Expressive power and complexity of partial models for disjunctive deductive databasesTheoretical Computer Science, 1998
- An abstract, argumentation-theoretic approach to default reasoningArtificial Intelligence, 1997
- Abstract argumentationArtificial Intelligence and Law, 1996
- The Complexity of Default Reasoning Under the Stationary Fixed Point SemanticsInformation and Computation, 1995
- The complexity of propositional closed world reasoning and circumscriptionJournal of Computer and System Sciences, 1994
- A survey of complexity results for non-monotonic logicsThe Journal of Logic Programming, 1993
- Propositional circumscription and extended closed-world reasoning are ΠP2-completeTheoretical Computer Science, 1993
- Reasoning with Parsimonious and Moderately Grounded ExpansionsFundamenta Informaticae, 1992
- Complexity Results for Nonmonotonic LogicsJournal of Logic and Computation, 1992
- Circumscription—A form of non-monotonic reasoningArtificial Intelligence, 1980