On the input/output behavior of argumentation frameworks
From MaRDI portal
Recommendations
- On the functional completeness of argumentation semantics
- An investigation of argumentation framework characteristics
- Robust semantics for argumentation frameworks
- On the incremental computation of semantics in dynamic argumentation
- Toward incremental computation of argumentation semantics: a decomposition-based approach
Cites work
- AFRA: argumentation framework with recursive attacks
- Analyzing the Equivalence Zoo in Abstract Argumentation
- Characterizing strong equivalence for argumentation frameworks
- Dynamics of argumentation systems: a division-based method
- Encompassing Attacks to Attacks in Abstract Argumentation Frameworks
- Fibring argumentation frames
- Meta-argumentation modelling. I: Methodology and techniques
- Modularity aspects of disjunctive stable models
- Normal and strong expansion equivalence for argumentation frameworks
- On principle-based evaluation of extension-based argumentation semantics
- On the Issue of Reinstatement in Argumentation
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
- On the intertranslatability of argumentation semantics
- On the resolution-based family of abstract argumentation semantics and its grounded instance
- 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
- Partial semantics of argumentation: basic properties and empirical
- Reasoning about preferences in argumentation frameworks
- SCC-recursiveness: a general schema for argumentation semantics
- Semantics for higher level attacks in extended argumentation frames. I: Overview
- Skepticism relations for comparing argumentation semantics
- Solving semantic problems with odd-length cycles in argumentation
- Splitting an Argumentation Framework
- Stage semantics and the SCC-recursive schema for argumentation semantics
- Strongly equivalent logic programs
- Weighted argument systems: basic definitions, algorithms, and complexity results
- What does it take to enforce an argument? Minimal change in abstract argumentation
Cited in
(18)- A Dynamic Approach for Combining Abstract Argumentation Semantics
- A general semi-structured formalism for computational argumentation: definition, properties, and examples of application
- Equivalence in logic-based argumentation
- A general notion of equivalence for abstract argumentation
- Credulous acceptance in high-order argumentation frameworks with necessities: an incremental approach
- On the acceptance of loops in argumentation frameworks
- scientific article; zbMATH DE number 7238902 (Why is no real title available?)
- Incremental computation of deterministic extensions for dynamic argumentation frameworks
- Argumentation update in YALLA (yet another logic language for argumentation)
- Structural Analysis of Extension-Based Argumentation Semantics with Joint Acceptability
- RAFDivider : a distributed algorithm for computing semantics in higher-order abstract argumentation frameworks
- Explainable acceptance in probabilistic and incomplete abstract argumentation frameworks
- A general approach to extension-based semantics in abstract argumentation
- Towards a general theory of decomposability in abstract argumentation
- On the functional completeness of argumentation semantics
- On the responsibility for undecisiveness in preferred and stable labellings in abstract argumentation
- Methods for solving reasoning problems in abstract argumentation -- a survey
- I don't care, I don't know \(\dots \) I know too much! on incompleteness and undecidedness in abstract argumentation
This page was built for publication: On the input/output behavior of argumentation frameworks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q464629)
