Pages that link to "Item:Q5405019"

The following pages link to Computing Preferred Extensions in Abstract Argumentation: A SAT-Based Approach (Q5405019):

Displaying 11 items.

• Looking-ahead in backtracking algorithms for abstract argumentation (Q324699) (← links)
• The first international competition on computational models of argumentation: results and analysis (Q1677447) (← links)
• On the impact of configuration on abstract argumentation automated reasoning (Q1687275) (← links)
• Characterizing acceptability semantics of argumentation frameworks with recursive attack and support relations (Q1711894) (← links)
• How we designed winning algorithms for abstract argumentation and which insight we attained (Q2289004) (← links)
• Methods for solving reasoning problems in abstract argumentation -- a survey (Q2341832) (← links)
• Pakota: A System for Enforcement in Abstract Argumentation (Q2835885) (← links)
• (Q5092437) (← links)
• New stochastic local search approaches for computing preferred extensions of abstract argumentation (Q5145445) (← links)
• Reduction-Based Approaches to Implement Modgil’s Extended Argumentation Frameworks (Q5172619) (← links)
• Dynamic epistemic logics for abstract argumentation (Q6147179) (← links)