Stochastic local search algorithms for abstract argumentation under stable semantics

DOI10.3233/978-1-61499-906-5-169MaRDI QIDQ5215683zbMATH OpenFDO

Authors Matthias Thimm

Publication date 12 February 2020

Full work available at URL https://doi.org/10.3233/978-1-61499-906-5-169

zbMATH Keywords

abstract argumentationalgorithmsstochastic local search

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic in artificial intelligence (68T27)

Recommendations

• New stochastic local search approaches for computing preferred extensions of abstract argumentation
• An Algorithm for Computing Semi-stable Semantics
• Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks
• Looking-ahead in backtracking algorithms for abstract argumentation
• On the maximal and average numbers of stable extensions

Cited in

(4)

• Using graph convolutional networks for approximate reasoning with abstract argumentation frameworks: a feasibility study
• scientific article; zbMATH DE number 2087874 (Why is no real title available?)
• New stochastic local search approaches for computing preferred extensions of abstract argumentation
• On the maximal and average numbers of stable extensions

This page was built for publication: Stochastic local search algorithms for abstract argumentation under stable semantics

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