Pages that link to "Item:Q2667835"
From MaRDI portal
The following pages link to Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all? (Q2667835):
Displaying 5 items.
- Does Treewidth Help in Modal Satisfiability? (Q5892171) (← 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)
- IASCAR: incremental answer set counting by anytime refinement (Q6656460) (← links)