Pages that link to "Item:Q2401930"
From MaRDI portal
The following pages link to Answer set solving with bounded treewidth revisited (Q2401930):
Displaying 8 items.
- A multiparametric view on answer set programming (Q2317973) (← links)
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all? (Q2667835) (← links)
- Solving projected model counting by utilizing treewidth and its limits (Q2680775) (← links)
- (Q5009490) (← links)
- (Q5009587) (← links)
- DynASP2.5: Dynamic Programming on Tree Decompositions in Action (Q5111876) (← links)
- (Q5111890) (← links)
- Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs (Q5240230) (← links)
