Pages that link to "Item:Q1761284"
From MaRDI portal
The following pages link to Augmenting tractable fragments of abstract argumentation (Q1761284):
Displaying 21 items.
- Complexity-sensitive decision procedures for abstract argumentation (Q490451) (← links)
- Backdoors into heterogeneous classes of SAT and CSP (Q730498) (← links)
- Complexity of abstract argumentation under a claim-centric view (Q785236) (← links)
- Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory (Q898737) (← links)
- Backdoors for linear temporal logic (Q1725638) (← links)
- Graph-classes of argumentation frameworks with collective attacks (Q2055773) (← 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)
- A distributed argumentation algorithm for mining consistent opinions in weighted Twitter discussions (Q2317506) (← links)
- Backdoors to planning (Q2321271) (← links)
- Methods for solving reasoning problems in abstract argumentation -- a survey (Q2341832) (← links)
- Backdoors to tractable answer set programming (Q2341833) (← links)
- Strong Backdoors for Default Logic (Q2818000) (← links)
- Backdoors to Satisfaction (Q2908542) (← links)
- Backdoor Sets for CSP. (Q4993598) (← links)
- Computational Short Cuts in Infinite Domain Constraint Satisfaction (Q5870497) (← links)
- Parameterised complexity of model checking and satisfiability in propositional dependence logic (Q5918486) (← links)
- The complexity landscape of claim-augmented argumentation frameworks (Q6099370) (← links)
- Backdoor DNFs (Q6564620) (← links)
- Strong backdoors for default logic (Q6570091) (← links)
- Strong backdoors for default logic (Q6610193) (← links)
