Treewidth-aware Reductions of Normal ASP to SAT - Is Normal ASP Harder than SAT after All?

Hecher, Markus

by Markus Hecher

Reference:

Treewidth-aware Reductions of Normal ASP to SAT - Is Normal ASP Harder than SAT after All?Markus HecherProceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, KR 2020, Rhodes, Greece, September 12-18, 2020 (Diego Calvanese, Esra Erdem, Michael Thielscher, eds.), pages 485–495, 2020.

Bibtex Entry:

@inproceedings{Hecher20,
keywords = "reveal",
  author    = {Markus Hecher},
  title     = {Treewidth-aware Reductions of Normal {ASP} to {SAT} - Is Normal {ASP}
               Harder than {SAT} after All?},
  pages     = {485--495},
  year      = {2020},
  booktitle = {Proceedings of the 17th International Conference on Principles of
               Knowledge Representation and Reasoning, {KR} 2020, Rhodes, Greece,
               September 12-18, 2020},
  editor = {Diego Calvanese and
               Esra Erdem and
               Michael Thielscher},
  xxxconference = {https://kr2020.inf.unibz.it/}
}