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

Markus Hecher

doi:10.24963/kr.2020/49

KR2020

Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning

Rhodes, Greece. September 12-18, 2020.

Edited by

ISSN: 2334-1033
ISBN: 978-0-9992411-7-2

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

Markus Hecher(TU Wien, Vienna, Austria, University of Potsdam, Potsdam, Germany)

Bibtex record

@inproceedings{KR2020-49,
    title     = {{Treewidth-aware Reductions of Normal ASP to SAT - Is Normal ASP Harder than SAT after All?}},
    author    = {Hecher, Markus},
    booktitle = {{Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning}},
    pages     = {485--495},
    year      = {2020},
    month     = {9},
    doi       = {10.24963/kr.2020/49},
    url       = {https://doi.org/10.24963/kr.2020/49},
  }

Go back