Toward incremental computation of argumentation semantics: a decomposition-based approach
From MaRDI portal
Publication:360248
DOI10.1007/S10472-013-9364-8zbMATH Open1328.03030OpenAlexW1992259854MaRDI QIDQ360248FDOQ360248
Publication date: 26 August 2013
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-013-9364-8
Recommendations
- Incremental computation of deterministic extensions for dynamic argumentation frameworks
- On the incremental computation of semantics in dynamic argumentation
- Partial semantics of argumentation: basic properties and empirical
- A forward propagation algorithm for the computation of the semantics of argumentation frameworks
- Augmenting tractable fragments of abstract argumentation
computational complexityargumentation semanticsabstract argumentation frameworklabelling-based computationlocal tractability
Cites Work
- Argumentation in artificial intelligence
- Computing ideal sceptical argumentation
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Dialectic proof procedures for assumption-based, admissible argumentation
- Depth-First Search and Linear Graph Algorithms
- Dynamics of argumentation systems: a division-based method
- Computational properties of argument systems satisfying graph-theoretic constraints
- A logical account of formal argumentation
- An Algorithm for Computing Semi-stable Semantics
- On the Issue of Reinstatement in Argumentation
- On Decision Problems Related to the Preferred Semantics for Argumentation Frameworks
- On principle-based evaluation of extension-based argumentation semantics
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- On the merging of Dung's argumentation systems
- Towards fixed-parameter tractable algorithms for abstract argumentation
- SCC-recursiveness: a general schema for argumentation semantics
- Preferred extensions as stable models
- Robust semantics for argumentation frameworks
- Algorithms and complexity results for persuasive argumentation
Cited In (10)
- Credulous acceptance in high-order argumentation frameworks with necessities: an incremental approach
- RAFDivider : a distributed algorithm for computing semantics in higher-order abstract argumentation frameworks
- On the Decomposition of Abstract Dialectical Frameworks and the Complexity of Naive-based Semantics
- Evidence-based argumentation and its incremental semantics
- Constrained derivation in assumption-based argumentation
- I don’t care, I don’t know … I know too much! On Incompleteness and Undecidedness in Abstract Argumentation
- Towards a general theory of decomposability in abstract argumentation
- The first international competition on computational models of argumentation: results and analysis
- Incremental computation for structured argumentation over dynamic DeLP knowledge bases
- On the responsibility for undecisiveness in preferred and stable labellings in abstract argumentation
Uses Software
This page was built for publication: Toward incremental computation of argumentation semantics: a decomposition-based approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q360248)
