Knowledge Processing and Information Systems
Treewidth-aware reductions of normal ASP to SAT - Is normal ASP harder than SAT after all?

@article{DBLP:journals/ai/Hecher22,
  title = {Treewidth-aware reductions of normal {ASP} to {SAT} - Is normal {ASP} harder than {SAT} after all?},
  author = {Hecher, Markus},
  journal = {Artif. Intell.},
  pages = {103651},
  volume = {304},
  year = {2022}
}