Pages that link to "Item:Q2341833"
From MaRDI portal
The following pages link to Backdoors to tractable answer set programming (Q2341833):
Displaying 13 items.
- Augmenting tractable fragments of abstract argumentation (Q1761284) (← links)
- A multiparametric view on answer set programming (Q2317973) (← links)
- Backdoors to planning (Q2321271) (← links)
- Strong Backdoors for Default Logic (Q2818000) (← links)
- Backdoor Sets for CSP. (Q4993598) (← links)
- Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs (Q5240230) (← links)
- Backdoors to Normality for Disjunctive Logic Programs (Q5277908) (← links)
- Computational Short Cuts in Infinite Domain Constraint Satisfaction (Q5870497) (← links)
- Parameterised complexity of model checking and satisfiability in propositional dependence logic (Q5918486) (← links)
- Backdoor DNFs (Q6564620) (← links)
- Aspmc: new frontiers of algebraic answer set counting (Q6566624) (← links)
- Strong backdoors for default logic (Q6570091) (← links)
- Strong backdoors for default logic (Q6610193) (← links)
