Pages that link to "Item:Q1028949"

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

Displaying 43 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)
• Graph-classes of argumentation frameworks with collective attacks (Q2055773) (← links)
• Indepth combinatorial analysis of admissible sets for abstract argumentation (Q2107484) (← links)
• New width parameters for SAT and \#SAT (Q2238644) (← links)
• Acceptance in incomplete argumentation frameworks (Q2238645) (← links)
• Argumentation frameworks as constraint satisfaction problems (Q2248522) (← links)
• Meta-argumentation modelling. I: Methodology and techniques (Q2269509) (← links)
• A distributed argumentation algorithm for mining consistent opinions in weighted Twitter discussions (Q2317506) (← links)
• A general notion of equivalence for abstract argumentation (Q2321336) (← links)
• Methods for solving reasoning problems in abstract argumentation -- a survey (Q2341832) (← links)
• Backdoors to tractable answer set programming (Q2341833) (← links)
• Weighted argumentation for analysis of discussions in Twitter (Q2409095) (← links)
• On checking skeptical and ideal admissibility in abstract argumentation frameworks (Q2419797) (← links)
• A QBF-based formalization of abstract argumentation semantics (Q2446545) (← links)
• On the preferred extensions of argumentation frameworks: bijections with naive sets (Q2681398) (← links)
• Backdoors to Satisfaction (Q2908542) (← links)
• Structural Analysis of Extension-Based Argumentation Semantics with Joint Acceptability (Q3305685) (← links)
• Equivalence in logic-based argumentation (Q4583352) (← links)
• Initial sets in abstract argumentation frameworks (Q4685532) (← links)
• Approximating agreements in formal argumentation dialogues1 (Q5145459) (← links)
• Automata, Languages and Programming (Q5716769) (← links)
• Lattice point of view for argumentation framework (Q6059223) (← links)
• The complexity landscape of claim-augmented argumentation frameworks (Q6099370) (← links)
• Query complexity of tournament solutions (Q6122601) (← links)
• Reasoning in assumption-based argumentation using tree-decompositions (Q6545531) (← links)