by Markus Hecher
Reference:
Treewidth-aware reductions of normal ASP to SAT - Is normal ASP harder than SAT after all?Markus HecherArtificial Intelligence, volume 304, pages 103651, 2022.
Bibtex Entry:
@string{ai="Artificial Intelligence"}
@article{DBLP:journals/ai/Hecher22,
keywords = "reveal",
author = {Markus Hecher},
title = {Treewidth-aware reductions of normal {ASP} to {SAT} - Is normal {ASP}
harder than {SAT} after all?},
journal = AI,
volume = {304},
pages = {103651},
year = {2022},
url = {10.1016/j.artint.2021.103651">https://doi.org/10.1016/j.artint.2021.103651},
doi = {10.1016/j.artint.2021.103651},
timestamp = {Wed, 23 Feb 2022 11:17:51 +0100},
biburl = {https://dblp.org/rec/journals/ai/Hecher22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}