Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks

DOI10.1007/978-3-540-87803-2_14zbMath1178.68557DBLPconf/jelia/DunneC08OpenAlexW1558684985WikidataQ62044307 ScholiaQ62044307MaRDI QIDQ3532464

Martin Caminada, Paul E. Dunne

Publication date: 27 October 2008

Published in: Logics in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87803-2_14

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Related Items (10)

Paracoherent Answer Set Semantics meets Argumentation Frameworks ⋮ On efficiently estimating the probability of extensions in abstract argumentation frameworks ⋮ A QBF-based formalization of abstract argumentation semantics ⋮ Complexity of semi-stable and stage semantics in argumentation frameworks ⋮ Complexity-sensitive decision procedures for abstract argumentation ⋮ Augmenting tractable fragments of abstract argumentation ⋮ Weighted argument systems: basic definitions, algorithms, and complexity results ⋮ On the resolution-based family of abstract argumentation semantics and its grounded instance ⋮ Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence ⋮ Methods for solving reasoning problems in abstract argumentation -- a survey

This page was built for publication: Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks