Partial semantics of argumentation: basic properties and empirical
From MaRDI portal
Recommendations
- Partial semantics of argumentation
- Toward incremental computation of argumentation semantics: a decomposition-based approach
- What is a reasonable argumentation semantics?
- Computing the grounded semantics in all the subgraphs of an argumentation framework: an empirical evaluation
- Handling Ignorance in Argumentation: Semantics of Partial Argumentation Frameworks
Cited in
(14)- Incremental computation for structured argumentation over dynamic DeLP knowledge bases
- Empirical study on human evaluation of complex argumentation frameworks
- Methods for solving reasoning problems in abstract argumentation -- a survey
- On topology-related properties of abstract argumentation semantics. A correction and extension to ``Dynamics of argumentation systems: a division-based method
- Towards a general theory of decomposability in abstract argumentation
- Computing the grounded semantics in all the subgraphs of an argumentation framework: an empirical evaluation
- Partial semantics of argumentation
- Handling Ignorance in Argumentation: Semantics of Partial Argumentation Frameworks
- Toward incremental computation of argumentation semantics: a decomposition-based approach
- scientific article; zbMATH DE number 1939514 (Why is no real title available?)
- On the input/output behavior of argumentation frameworks
- I don't care, I don't know \(\dots \) I know too much! on incompleteness and undecidedness in abstract argumentation
- Layered argumentation frameworks with subargument relation
- Credulous acceptance in high-order argumentation frameworks with necessities: an incremental approach
This page was built for publication: Partial semantics of argumentation: basic properties and empirical
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300581)
