An Algorithm for Computing Semi-stable Semantics

DOI10.1007/978-3-540-75256-1_22zbMath1148.68502OpenAlexW2120554020WikidataQ62044309 ScholiaQ62044309MaRDI QIDQ3524932

Martin Caminada

Publication date: 16 September 2008

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

Full work available at URL: http://orca.cf.ac.uk/84298/1/algorithm_ECSQARU.pdf

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (16)

Looking-ahead in backtracking algorithms for abstract argumentation ⋮ Toward incremental computation of argumentation semantics: a decomposition-based approach ⋮ Equilibrium states in numerical argumentation networks ⋮ Characterizing strong equivalence for argumentation frameworks ⋮ Fuzzy labeling semantics for quantitative argumentation ⋮ An Algorithm for Computing Semi-stable Semantics ⋮ Dynamics of argumentation systems: a division-based method ⋮ Complexity of semi-stable and stage semantics in argumentation frameworks ⋮ Algorithms for decision problems in argument systems under preferred semantics ⋮ A characterization of types of support between structured arguments and their relationship with support in abstract argumentation ⋮ Modal and Temporal Argumentation Networks ⋮ Complete extensions in argumentation coincide with 3-valued stable models in logic programming ⋮ A logical account of formal argumentation ⋮ Unnamed Item ⋮ Partial Semantics of Argumentation ⋮ Methods for solving reasoning problems in abstract argumentation -- a survey

Cites Work

• Unnamed Item
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• An Algorithm for Computing Semi-stable Semantics
• On the Issue of Reinstatement in Argumentation

This page was built for publication: An Algorithm for Computing Semi-stable Semantics