Computing the Grounded Semantics in all the Subgraphs of an Argumentation Framework: An Empirical Evaluation

DOI10.1007/978-3-642-40624-9_8zbMath1401.68303OpenAlexW105397534MaRDI QIDQ2851962

Pierpaolo Dondio

Publication date: 4 October 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arrow.dit.ie/cgi/viewcontent.cgi?article=1027&context=scschcomart

zbMATH Keywords

algorithmssemanticsargumentation theory

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Related Items (2)

On efficiently estimating the probability of extensions in abstract argumentation frameworks ⋮ Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence

This page was built for publication: Computing the Grounded Semantics in all the Subgraphs of an Argumentation Framework: An Empirical Evaluation