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

DOI10.1016/S0004-3702(02)00245-XzbMath1043.68097OpenAlexW2006784674WikidataQ62039892 ScholiaQ62039892MaRDI QIDQ1852857

Yannis Dimopoulos, Bernhard Nebel, Francesca Toni

Publication date: 21 January 2003

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0004-3702(02)00245-x

zbMATH Keywords

Computational complexityAbductionArgumentationDefault reasoningNon-monotonic reasoningAssumption-based reasoning

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (20)

Harnessing Incremental Answer Set Solving for Reasoning in Assumption-Based Argumentation ⋮ Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory ⋮ Algorithms for generating arguments and counterarguments in propositional logic ⋮ Dynamics of argumentation systems: a division-based method ⋮ Dialectic proof procedures for assumption-based, admissible argumentation ⋮ Structural Analysis of Extension-Based Argumentation Semantics with Joint Acceptability ⋮ Computational complexity of flat and generic assumption-based argumentation, with and without probabilities ⋮ On argumentation logic and propositional logic ⋮ Uses and computation of imprecise probabilities from statistical data and expert arguments ⋮ Assumption-Based Argumentation for Selection and Composition of Services ⋮ Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach ⋮ Argumentation in artificial intelligence ⋮ Computing ideal sceptical argumentation ⋮ Computational properties of argument systems satisfying graph-theoretic constraints ⋮ An application of formal argumentation: fusing Bayesian networks in multi-agent systems ⋮ Handling controversial arguments ⋮ The computational complexity of ideal semantics ⋮ Complexity of abstract argumentation under a claim-centric view ⋮ Argument graphs and assumption-based argumentation ⋮ Two party immediate response disputes: Properties and efficiency

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semantical considerations on nonmonotonic logic
• A logical framework for default reasoning
• A logic for default reasoning
• Circumscription - a form of non-monotonic reasoning
• Expressive power and complexity of partial models for disjunctive deductive databases
• The complexity of propositional closed world reasoning and circumscription
• The expressive powers of stable models for bound and unbound DATALOG queries
• An abstract, argumentation-theoretic approach to default reasoning
• The complexity of default reasoning under the stationary fixed point semantics
• Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
• Nonmonotonic Logic II
• Complexity Results for Nonmonotonic Logics
• A survey of complexity results for non-monotonic logics

This page was built for publication: On the computational complexity of assumption-based argumentation for default reasoning.