Incremental computation of deterministic extensions for dynamic argumentation frameworks
From MaRDI portal
Recommendations
- On the incremental computation of semantics in dynamic argumentation
- scientific article; zbMATH DE number 7368407
- Incremental computation for structured argumentation over dynamic DeLP knowledge bases
- Dynamics of argumentation systems: a division-based method
- Toward incremental computation of argumentation semantics: a decomposition-based approach
Cites work
- scientific article; zbMATH DE number 1759381 (Why is no real title available?)
- scientific article; zbMATH DE number 6292806 (Why is no real title available?)
- Advances in knowledge representation, logic programming, and abstract argumentation. Essays dedicated to Gerhard Brewka on the occasion of his 60th birthday
- Argumentation in artificial intelligence
- Change in abstract argumentation frameworks: adding an argument
- Characterizing strong equivalence for argumentation frameworks
- Complexity of semi-stable and stage semantics in argumentation frameworks
- Computing ideal sceptical argumentation
- Context-free and context-sensitive kernels: update and deletion equivalence in abstract argumentation
- Detecting Decidable Classes of Finitely Ground Logic Programs with Function Symbols
- Dynamics in Argumentation with Single Extensions: Abstraction Principles and the Grounded Extension
- Dynamics of argumentation systems: a division-based method
- Incremental computation of deterministic extensions for dynamic argumentation frameworks
- Logic programming with function symbols: checking termination of bottom-up evaluation through program adornments
- Methods for solving reasoning problems in abstract argumentation -- a survey
- Normal and strong expansion equivalence for argumentation frameworks
- On efficiently estimating the probability of extensions in abstract argumentation frameworks
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
- On the complexity of probabilistic abstract argumentation frameworks
- On the equivalence between logic programming semantics and argumentation semantics
- On the input/output behavior of argumentation frameworks
- On topology-related properties of abstract argumentation semantics. A correction and extension to ``Dynamics of argumentation systems: a division-based method
- Parameterized splitting: a simple modification-based approach
- Revising option status in argument-based decision systems
- Splitting an Argumentation Framework
- The computational complexity of ideal semantics
- The matrix approach for abstract argumentation frameworks
- Towards fixed-parameter tractable algorithms for abstract argumentation
- Two party immediate response disputes: Properties and efficiency
- \(\mathcal {NPD}\)atalog: A logic language for expressing \(\mathcal {NP}\) search and optimization problems
Cited in
(16)- How we designed winning algorithms for abstract argumentation and which insight we attained
- Credulous acceptance in high-order argumentation frameworks with necessities: an incremental approach
- Incremental computation of deterministic extensions for dynamic argumentation frameworks
- Acceptance in incomplete argumentation frameworks
- On the semantics of abstract argumentation frameworks: a logic programming approach
- Structural constraints for dynamic operators in abstract argumentation
- Dynamics of argumentation systems: a division-based method
- Extension-based semantics for incomplete argumentation frameworks: properties, complexity and algorithms
- The complexity of repairing, adjusting, and aggregating of extensions in abstract argumentation
- Change in abstract argumentation frameworks: adding an argument
- On the incremental computation of semantics in dynamic argumentation
- Toward incremental computation of argumentation semantics: a decomposition-based approach
- On topology-related properties of abstract argumentation semantics. A correction and extension to ``Dynamics of argumentation systems: a division-based method
- Strong refinements for hard problems in argumentation dynamics
- Incremental computation for structured argumentation over dynamic DeLP knowledge bases
- Deductive argumentation by enhanced sequent calculi and dynamic derivations
This page was built for publication: Incremental computation of deterministic extensions for dynamic argumentation frameworks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2835878)
