Pages that link to "Item:Q2238645"
From MaRDI portal
The following pages link to Acceptance in incomplete argumentation frameworks (Q2238645):
Displaying 15 items.
- Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving (Q2124467) (← links)
- The possible winner problem with uncertain weights revisited (Q2140520) (← links)
- Constrained incomplete argumentation frameworks (Q2146007) (← links)
- Computing smallest MUSes of quantified Boolean formulas (Q2694579) (← links)
- Abstract argumentation with qualitative uncertainty: an analysis in dynamic logic (Q2695515) (← links)
- Extension-based semantics for incomplete argumentation frameworks (Q2695523) (← links)
- Towards Evidence Retrieval Cost Reduction in Abstract Argumentation Frameworks with Fallible Evidence (Q5870514) (← links)
- Explainable acceptance in probabilistic and incomplete abstract argumentation frameworks (Q6080638) (← links)
- The complexity landscape of claim-augmented argumentation frameworks (Q6099370) (← links)
- The possible winner with uncertain weights problem (Q6133655) (← links)
- Taking into account ``who said what'' in abstract argumentation: complexity results (Q6161469) (← links)
- On dynamics in structured argumentation formalisms (Q6488791) (← links)
- Extension-based semantics for incomplete argumentation frameworks: grounded semantics and principles (Q6587907) (← links)
- Efficient analysis of belief properties in process algebra (Q6615566) (← links)
- How to manage supports in incomplete argumentation (Q6630206) (← links)
