Partial semantics of argumentation: basic properties and empirical

DOI10.1093/logcom/exs047zbMath1267.68225OpenAlexW2103867296MaRDI QIDQ5300581

Beishui Liao, Huaxin Huang

Publication date: 27 June 2013

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exs047

zbMATH Keywords

computational complexitylocal computationargumentation semanticsabstract argumentation frameworks

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Related Items (6)

Towards a general theory of decomposability in abstract argumentation ⋮ On the input/output behavior of argumentation frameworks ⋮ On topology-related properties of abstract argumentation semantics. A correction and extension to ``Dynamics of argumentation systems: a division-based method ⋮ Incremental computation for structured argumentation over dynamic DeLP knowledge bases ⋮ I don’t care, I don’t know … I know too much! On Incompleteness and Undecidedness in Abstract Argumentation ⋮ Methods for solving reasoning problems in abstract argumentation -- a survey

Uses Software

• ASPARTIX

This page was built for publication: Partial semantics of argumentation: basic properties and empirical