Pages that link to "Item:Q1028949"

The following pages link to Computational properties of argument systems satisfying graph-theoretic constraints (Q1028949):

Displaying 21 items.

• Looking-ahead in backtracking algorithms for abstract argumentation (Q324699) (← links)
• On rejected arguments and implicit conflicts: the hidden power of argumentation semantics (Q334820) (← links)
• Toward incremental computation of argumentation semantics: a decomposition-based approach (Q360248) (← links)
• Minimal retentive sets in tournaments (Q483107) (← links)
• Complexity-sensitive decision procedures for abstract argumentation (Q490451) (← links)
• Algorithms for decision problems in argument systems under preferred semantics (Q490457) (← links)
• Uses and computation of imprecise probabilities from statistical data and expert arguments (Q505254) (← links)
• Weighted argument systems: basic definitions, algorithms, and complexity results (Q543610) (← links)
• On the resolution-based family of abstract argumentation semantics and its grounded instance (Q543626) (← links)
• Algorithms and complexity results for persuasive argumentation (Q646518) (← links)
• Dynamics of argumentation systems: a division-based method (Q650522) (← links)
• Complexity of semi-stable and stage semantics in argumentation frameworks (Q656597) (← links)
• A new approach for preference-based argumentation frameworks (Q766045) (← links)
• Complexity of abstract argumentation under a claim-centric view (Q785236) (← links)
• A computational analysis of the tournament equilibrium set (Q964822) (← links)
• The computational complexity of ideal semantics (Q1045987) (← links)
• Towards fixed-parameter tractable algorithms for abstract argumentation (Q1761281) (← links)
• Augmenting tractable fragments of abstract argumentation (Q1761284) (← links)
• Valid attacks in argumentation frameworks with recursive attacks (Q2029707) (← links)
• Backdoors to Satisfaction (Q2908542) (← links)
• Initial sets in abstract argumentation frameworks (Q4685532) (← links)