scientific article; zbMATH DE number 7561718

DOI10.4230/LIPICS.MFCS.2019.74MaRDI QIDQ5092437FDOQ5092437

Authors: Serge Gaspers, Ray Li 

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/1907.01006

Title of this publication is not available (Why is that?)

zbMATH Keywords

exact algorithmsparameterized algorithmsabstract argumentationenumeration algorithmsexponential time algorithmssemikernels in digraphs

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Title not available (Why is that?)
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• A measure & conquer approach for the analysis of exact algorithms
• Exact exponential algorithms.
• Parameterized Algorithms
• Semikernels and (k,l)-Kernels in Digraphs
• On kernels and semikernels of digraphs
• A reasoning model based on the production of acceptable arguments
• Methods for solving reasoning problems in abstract argumentation -- a survey
• An Algorithm for Computing Semi-stable Semantics
• Title not available (Why is that?)
• Algorithms for decision problems in argument systems under preferred semantics
• Computing preferred extensions in abstract argumentation: a SAT-based approach
• Open Problems in Abstract Argumentation
• Hierarchical Argumentation
• Exact Algorithms via Monotone Local Search
• Enumerating the kernels of a directed graph with no odd circuits
• A Comparative Test on the Enumeration of Extensions in Abstract Argumentation*
• On the impact of configuration on abstract argumentation automated reasoning
• Exact Algorithms via Multivariate Subroutines

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092437)