scientific article; zbMATH DE number 7561718
From MaRDI portal
Publication:5092437
DOI10.4230/LIPIcs.MFCS.2019.74MaRDI QIDQ5092437
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1907.01006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
parameterized algorithmsexact algorithmsabstract argumentationenumeration algorithmsexponential time algorithmssemikernels in digraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Algorithms for decision problems in argument systems under preferred semantics
- Exact exponential algorithms.
- On kernels and semikernels of digraphs
- Enumerating the kernels of a directed graph with no odd circuits
- A reasoning model based on the production of acceptable arguments
- On the impact of configuration on abstract argumentation automated reasoning
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Methods for solving reasoning problems in abstract argumentation -- a survey
- A Comparative Test on the Enumeration of Extensions in Abstract Argumentation*
- A measure & conquer approach for the analysis of exact algorithms
- An Algorithm for Computing Semi-stable Semantics
- Hierarchical Argumentation
- Semikernels and (k,l)-Kernels in Digraphs
- Exact Algorithms via Multivariate Subroutines
- Open Problems in Abstract Argumentation
- Exact Algorithms via Monotone Local Search
- Computing Preferred Extensions in Abstract Argumentation: A SAT-Based Approach
- Parameterized Algorithms
This page was built for publication:
