Preferred extensions of argumentation frameworks: Query, answering, and computation
From MaRDI portal
Recommendations
- Algorithms for decision problems in argument systems under preferred semantics
- Preferred extensions as stable models
- On Decision Problems Related to the Preferred Semantics for Argumentation Frameworks
- A forward propagation algorithm for the computation of the semantics of argumentation frameworks
- A new approach for preference-based argumentation frameworks
Cited in
(29)- Argumentation in artificial intelligence
- An application of formal argumentation: fusing Bayesian networks in multi-agent systems
- On the responsibility for undecisiveness in preferred and stable labellings in abstract argumentation
- Towards fixed-parameter tractable algorithms for abstract argumentation
- Minimal hypotheses: extension-based semantics to argumentation
- Extended explanatory argumentation frameworks
- A forward propagation algorithm for the computation of the semantics of argumentation frameworks
- Methods for solving reasoning problems in abstract argumentation -- a survey
- On checking skeptical and ideal admissibility in abstract argumentation frameworks
- On the preferred extensions of argumentation frameworks: bijections with naive sets
- The choice-preferred semantics for relevance-oriented acceptance of admissible sets of arguments
- Preferred semantics as Socratic discussion
- Computation in extended argumentation frameworks
- Two roles of preferences in argumentation frameworks
- Looking-ahead in backtracking algorithms for abstract argumentation
- Preferred extensions as stable models
- An Algorithm for Computing Semi-stable Semantics
- On Decision Problems Related to the Preferred Semantics for Argumentation Frameworks
- On the computation of Top-k extensions in abstract argumentation frameworks
- Dialectical proof theories for the credulous preferred semantics of argumentation frameworks
- Complexity-sensitive decision procedures for abstract argumentation
- Algorithms for decision problems in argument systems under preferred semantics
- Enumeration of preferred extensions in almost oriented digraphs
- New stochastic local search approaches for computing preferred extensions of abstract argumentation
- Computing preferred labellings by exploiting SCCs and most sceptically rejected arguments
- Algorithms for argumentation semantics: labeling attacks as a generalization of labeling arguments
- Lattice point of view for argumentation framework
- scientific article; zbMATH DE number 7696698 (Why is no real title available?)
- Computing stable extensions of argumentation frameworks using formal concept analysis
This page was built for publication: Preferred extensions of argumentation frameworks: Query, answering, and computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4540006)