Pages that link to "Item:Q5410728"
From MaRDI portal
The following pages link to Tractable answer-set programming with weight constraints: bounded treewidth is not enough (Q5410728):
Displayed 5 items.
- New width parameters for SAT and \#SAT (Q2238644) (← links)
- A multiparametric view on answer set programming (Q2317973) (← links)
- Complexity and approximability of parameterized MAX-CSPs (Q2408203) (← links)
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all? (Q2667835) (← links)
- Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs (Q5240230) (← links)