The following pages link to (Q3160990):
Displaying 22 items.
- Normal and strong expansion equivalence for argumentation frameworks (Q359982) (← links)
- Characterizing strong equivalence for argumentation frameworks (Q420788) (← links)
- Modeling time and valuation in structured argumentation frameworks (Q508777) (← links)
- Algorithms and complexity results for persuasive argumentation (Q646518) (← links)
- Complexity of abstract argumentation under a claim-centric view (Q785236) (← links)
- Characteristics of multiple viewpoints in abstract argumentation (Q896434) (← links)
- Revision of defeasible preferences (Q1726329) (← links)
- Empirical evaluation of abstract argumentation: supporting the need for bipolar and probabilistic approaches (Q1726415) (← links)
- Towards fixed-parameter tractable algorithms for abstract argumentation (Q1761281) (← links)
- Augmenting tractable fragments of abstract argumentation (Q1761284) (← links)
- Computational complexity of flat and generic assumption-based argumentation, with and without probabilities (Q2238615) (← links)
- Realizability of three-valued semantics for abstract dialectical frameworks (Q2287192) (← links)
- A formal framework for deliberated judgment (Q2300615) (← links)
- A general notion of equivalence for abstract argumentation (Q2321336) (← links)
- Methods for solving reasoning problems in abstract argumentation -- a survey (Q2341832) (← links)
- (Q4557972) (← links)
- (Q4557983) (← links)
- (Q5090465) (← links)
- Admissibility in Probabilistic Argumentation (Q5094045) (← links)
- The complexity landscape of claim-augmented argumentation frameworks (Q6099370) (← links)
- Theoretical analysis and implementation of abstract argumentation frameworks with domain assignments (Q6178732) (← links)
- Computing stable extensions of argumentation frameworks using formal concept analysis (Q6545530) (← links)
