Pages that link to "Item:Q5277908"
From MaRDI portal
The following pages link to Backdoors to Normality for Disjunctive Logic Programs (Q5277908):
Displayed 7 items.
- Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search (Q457253) (← links)
- A multiparametric view on answer set programming (Q2317973) (← links)
- Backdoors to planning (Q2321271) (← links)
- Backdoors to tractable answer set programming (Q2341833) (← links)
- Strong Backdoors for Default Logic (Q2818000) (← links)
- Backdoor Sets for CSP. (Q4993598) (← links)
- Parameterised complexity of model checking and satisfiability in propositional dependence logic (Q5918486) (← links)