Characterizing Structural Hardness of Logic Programs: What makes Cycles and Reachability Hard for Treewidth?

Hecher, Markus

by Markus Hecher

Reference:

Characterizing Structural Hardness of Logic Programs: What makes Cycles and Reachability Hard for Treewidth?Markus Hecher37th AAAI Conference on Artificial Intelligence, pages 6407–6415, 2023.

Bibtex Entry:

@inproceedings{Hecher23b,
keywords = "reveal",
title     = {{Characterizing Structural Hardness of Logic Programs: What makes Cycles and Reachability Hard for Treewidth?}},
author    = {Hecher, Markus},
booktitle = {37th AAAI Conference on Artificial Intelligence},
location  = {Washington, USA},
url = {https://doi.org/10.1609/aaai.v37i5.25788},
year      = {2023},
pages  = {6407--6415}
}