An Algorithm for Computing Semi-stable Semantics

DOI10.1007/978-3-540-75256-1_22MaRDI QIDQ3524932zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Recommendations

• Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks
• Semi-stable semantics
• scientific article; zbMATH DE number 1769206
• A forward propagation algorithm for the computation of the semantics of argumentation frameworks
• Complexity of semi-stable and stage semantics in argumentation frameworks

Cites work

• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• An Algorithm for Computing Semi-stable Semantics
• On the Issue of Reinstatement in Argumentation
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games

Cited in

(26)

• Algorithms for decision problems in argument systems under preferred semantics
• An Algorithm for Computing Semi-stable Semantics
• Partial semantics of argumentation
• Stochastic local search algorithms for abstract argumentation under stable semantics
• Complexity of semi-stable and stage semantics in argumentation frameworks
• Complete extensions in argumentation coincide with 3-valued stable models in logic programming
• Characterizing strong equivalence for argumentation frameworks
• scientific article; zbMATH DE number 3639177 (Why is no real title available?)
• Characterizations of the stable semantics by partial evaluation
• A logical account of formal argumentation
• Computing stable extensions of argumentation frameworks using formal concept analysis
• Semi-stable semantics
• A forward propagation algorithm for the computation of the semantics of argumentation frameworks
• A characterization of types of support between structured arguments and their relationship with support in abstract argumentation
• Toward incremental computation of argumentation semantics: a decomposition-based approach
• Fuzzy labeling semantics for quantitative argumentation
• Equilibrium states in numerical argumentation networks
• Enumeration of preferred extensions in almost oriented digraphs
• Modal and temporal argumentation networks
• Stability of weak second-order semantics
• scientific article; zbMATH DE number 844104 (Why is no real title available?)
• Looking-ahead in backtracking algorithms for abstract argumentation
• Dynamics of argumentation systems: a division-based method
• A Consistent Semantics of Self-adjusting Computation
• Methods for solving reasoning problems in abstract argumentation -- a survey
• Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks

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

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