Pages that link to "Item:Q5371007"
From MaRDI portal
The following pages link to Complexity Results and Algorithms for Extension Enforcement in Abstract Argumentation (Q5371007):
Displaying 15 items.
- Complexity-sensitive decision procedures for abstract argumentation (Q490451) (← links)
- Verification in incomplete argumentation frameworks (Q668774) (← links)
- Constrained incomplete argumentation frameworks (Q2146007) (← links)
- Complexity of nonemptiness in control argumentation frameworks (Q2146008) (← links)
- Acceptance in incomplete argumentation frameworks (Q2238645) (← links)
- How can you resolve a trilemma? A topological approach (Q2695529) (← links)
- Abstract Argumentation in Dynamic Logic: Representation, Reasoning and Change (Q3305693) (← links)
- Complexity of Possible and Necessary Existence Problems in Abstract Argumentation (Q4999294) (← links)
- (Q5188198) (← links)
- Extension-based semantics for incomplete argumentation frameworks: properties, complexity and algorithms (Q5885771) (← links)
- The complexity landscape of claim-augmented argumentation frameworks (Q6099370) (← links)
- Taking into account ``who said what'' in abstract argumentation: complexity results (Q6161469) (← links)
- Extended McCormick relaxation rules for handling empty arguments representing infeasibility (Q6166098) (← links)
- On dynamics in structured argumentation formalisms (Q6488791) (← links)
- Equivalence in argumentation frameworks with a claim-centric view: classical results with novel ingredients (Q6488795) (← links)