Enumeration of preferred extensions in almost oriented digraphs
From MaRDI portal
Publication:5092437
Recommendations
- scientific article; zbMATH DE number 1769206
- Algorithms for decision problems in argument systems under preferred semantics
- Algorithms for argumentation semantics: labeling attacks as a generalization of labeling arguments
- On kernels, defaults and even graphs
- On the computation of Top-\(k\) extensions in abstract argumentation frameworks
Cites work
- scientific article; zbMATH DE number 1769206 (Why is no real title available?)
- scientific article; zbMATH DE number 3106184 (Why is no real title available?)
- A comparative test on the enumeration of extensions in abstract argumentation
- A measure \& conquer approach for the analysis of exact algorithms
- A reasoning model based on the production of acceptable arguments
- Algorithms for decision problems in argument systems under preferred semantics
- An Algorithm for Computing Semi-stable Semantics
- Computing preferred extensions in abstract argumentation: a SAT-based approach
- Enumerating the kernels of a directed graph with no odd circuits
- Exact algorithms via multivariate subroutines
- Exact exponential algorithms.
- Hierarchical Argumentation
- Methods for solving reasoning problems in abstract argumentation -- a survey
- On kernels and semikernels of digraphs
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
- On the impact of configuration on abstract argumentation automated reasoning
- Open problems in abstract argumentation
- Parameterized algorithms
- Semikernels and (k,l)-Kernels in Digraphs
This page was built for publication: Enumeration of preferred extensions in almost oriented digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092437)
