Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all? (Q2667835)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all? |
scientific article |
Statements
Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all? (English)
0 references
2 March 2022
0 references
answer set programming
0 references
treewidth
0 references
parameterized complexity
0 references
complexity analysis
0 references
tree decomposition
0 references
treewidth-aware reductions
0 references
0 references
0 references
0 references
0 references
