Reasoning in assumption-based argumentation using tree-decompositions

DOI10.1007/978-3-031-43619-2_14MaRDI QIDQ6545531zbMATH OpenFDO

Authors Andrei Popescu, Johannes Wallner

Publication date 29 May 2024

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-031-43619-2_14

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Recommendations

• Declarative algorithms and complexity results for assumption-based argumentation
• Harnessing Incremental Answer Set Solving for Reasoning in Assumption-Based Argumentation
• From structured to abstract argumentation: assumption-based acceptance via AF reasoning
• Computational complexity of flat and generic assumption-based argumentation, with and without probabilities
• Reasoning on the web with assumption-based argumentation

Cites work

• A general account of argumentation with preferences
• A practical account into counting Dung's extensions by dynamic programming
• An abstract, argumentation-theoretic approach to default reasoning
• Answer set solving with bounded treewidth revisited
• Argument graphs and assumption-based argumentation
• Bounded treewidth as a key to tractability of knowledge representation and reasoning
• Computational complexity of flat and generic assumption-based argumentation, with and without probabilities
• Computational properties of argument systems satisfying graph-theoretic constraints
• D-FLAT^2: subset minimization in dynamic programming on tree decompositions made easy
• Declarative algorithms and complexity results for assumption-based argumentation
• Defeasible logic programming: an argumentative approach
• Exploiting Database Management Systems and Treewidth for Counting
• scientific article; zbMATH DE number 566078 (Why is no real title available?)
• scientific article; zbMATH DE number 1142315 (Why is no real title available?)
• scientific article; zbMATH DE number 6934384 (Why is no real title available?)
• scientific article; zbMATH DE number 7572560 (Why is no real title available?)
• Logic programs with stable model semantics as a constraint programming paradigm
• Lower Bounds for QBFs of Bounded Treewidth
• Methods for solving reasoning problems in abstract argumentation -- a survey
• Multi-shot ASP solving with clingo
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
• On the computational complexity of assumption-based argumentation for default reasoning.
• On the evaluation of argumentation formalisms
• QBF as an alternative to Courcelle's theorem
• The D-FLAT system for dynamic programming on tree decompositions
• The first international competition on computational models of argumentation: results and analysis
• Towards fixed-parameter tractable algorithms for abstract argumentation

Cited in

(1)

• ICCMA 2023: 5th international competition on computational models of argumentation

This page was built for publication: Reasoning in assumption-based argumentation using tree-decompositions

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