Pages that link to "Item:Q490451"

The following pages link to Complexity-sensitive decision procedures for abstract argumentation (Q490451):

Displaying 19 items.

• On rejected arguments and implicit conflicts: the hidden power of argumentation semantics (Q334820) (← links)
• Synchronous counting and computational algorithm design (Q896024) (← links)
• Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory (Q898737) (← links)
• The first international competition on computational models of argumentation: results and analysis (Q1677447) (← links)
• Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving (Q2124467) (← links)
• Acceptance in incomplete argumentation frameworks (Q2238645) (← links)
• Design and results of the second international competition on computational models of argumentation (Q2287197) (← 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)
• Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem (Q2938540) (← links)
• On the Complexity of Probabilistic Abstract Argumentation Frameworks (Q2946762) (← links)
• Improved answer-set programming encodings for abstract argumentation (Q4592988) (← 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)
• What Is a Reasonable Argumentation Semantics? (Q5172623) (← links)
• Explainable acceptance in probabilistic and incomplete abstract argumentation frameworks (Q6080638) (← links)
• The complexity landscape of claim-augmented argumentation frameworks (Q6099370) (← links)
• ASP and subset minimality: enumeration, cautious reasoning and MUSes (Q6103676) (← links)