Declarative algorithms and complexity results for assumption-based argumentation

DOI10.1613/JAIR.1.12479MaRDI QIDQ5009697zbMATH OpenOpenAlexWikidataFDO

Authors Tuomo Lehtonen, Johannes Wallner, Matti Järvisalo

Publication date 5 August 2021

Published in Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1613/jair.1.12479

zbMATH Keywords

nonmonotonic reasoning

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Recommendations

• Complexity results and algorithms for extension enforcement in abstract argumentation
• From structured to abstract argumentation: assumption-based acceptance via AF reasoning
• Epistemic argumentation framework: theory and computation
• Reasoning on the web with assumption-based argumentation
• On the computational complexity of assumption-based argumentation for default reasoning.

Cited in

(20)

• Computational properties of argument systems satisfying graph-theoretic constraints
• A general semi-structured formalism for computational argumentation: definition, properties, and examples of application
• On the computational complexity of assumption-based argumentation for default reasoning.
• Computational complexity of flat and generic assumption-based argumentation, with and without probabilities
• Reasoning on the web with assumption-based argumentation
• scientific article; zbMATH DE number 2086469 (Why is no real title available?)
• Complexity-sensitive decision procedures for abstract argumentation
• Goal-Driven Structured Argumentation for Patient Management in a Multimorbidity Setting
• Complexity results and algorithms for extension enforcement in abstract argumentation
• Assumption-Based Argumentation for Epistemic and Practical Reasoning
• Automata, Languages and Programming
• Harnessing Incremental Answer Set Solving for Reasoning in Assumption-Based Argumentation
• A general framework for preferences in answer set programming
• Theoretical analysis and implementation of abstract argumentation frameworks with domain assignments
• On the study of acceptability in weighted argumentation frameworks through four-state labelling semantics
• Reasoning in assumption-based argumentation using tree-decompositions
• Constrained derivation in assumption-based argumentation
• Completing structured arguments in assumption-based argumentation
• Argumentative reasoning in ASPIC^+ under incomplete information
• ICCMA 2023: 5th international competition on computational models of argumentation

This page was built for publication: Declarative algorithms and complexity results for assumption-based argumentation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5009697)