Pages that link to "Item:Q1761281"
From MaRDI portal
The following pages link to Towards fixed-parameter tractable algorithms for abstract argumentation (Q1761281):
Displayed 18 items.
- Toward incremental computation of argumentation semantics: a decomposition-based approach (Q360248) (← links)
- Complexity-sensitive decision procedures for abstract argumentation (Q490451) (← links)
- Algorithms for decision problems in argument systems under preferred semantics (Q490457) (← links)
- Algorithms and complexity results for persuasive argumentation (Q646518) (← links)
- Complexity of abstract argumentation under a claim-centric view (Q785236) (← links)
- Augmenting tractable fragments of abstract argumentation (Q1761284) (← links)
- Graph-classes of argumentation frameworks with collective attacks (Q2055773) (← links)
- Acceptance in incomplete argumentation frameworks (Q2238645) (← links)
- How we designed winning algorithms for abstract argumentation and which insight we attained (Q2289004) (← links)
- A general notion of equivalence for abstract argumentation (Q2321336) (← links)
- Methods for solving reasoning problems in abstract argumentation -- a survey (Q2341832) (← links)
- Weighted argumentation for analysis of discussions in Twitter (Q2409095) (← links)
- A practical account into counting Dung's extensions by dynamic programming (Q2694593) (← links)
- Incremental Computation of Deterministic Extensions for Dynamic Argumentation Frameworks (Q2835878) (← links)
- Efficient Problem Solving on Tree Decompositions Using Binary Decision Diagrams (Q3449205) (← links)
- Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs (Q5240230) (← links)
- <i>RAFDivider</i> : a distributed algorithm for computing semantics in higher-order abstract argumentation frameworks (Q6056711) (← links)
- The complexity landscape of claim-augmented argumentation frameworks (Q6099370) (← links)