ML Anthology

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

Markus Hecher
AAAI 2023 pp. 6407-6415
doi:10.1609/AAAI.V37I5.25788 /aaai/2023/hecher2023aaai-characterizing/
AAAI Semantic Scholar

Cite

Text

Hecher. "Characterizing Structural Hardness of Logic Programs: What Makes Cycles and Reachability Hard for Treewidth?." AAAI Conference on Artificial Intelligence, 2023. doi:10.1609/AAAI.V37I5.25788

Markdown

[Hecher. "Characterizing Structural Hardness of Logic Programs: What Makes Cycles and Reachability Hard for Treewidth?." AAAI Conference on Artificial Intelligence, 2023.](https://mlanthology.org/aaai/2023/hecher2023aaai-characterizing/) doi:10.1609/AAAI.V37I5.25788

BibTeX

@inproceedings{hecher2023aaai-characterizing,
  title     = {{Characterizing Structural Hardness of Logic Programs: What Makes Cycles and Reachability Hard for Treewidth?}},
  author    = {Hecher, Markus},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2023},
  pages     = {6407-6415},
  doi       = {10.1609/AAAI.V37I5.25788},
  url       = {https://mlanthology.org/aaai/2023/hecher2023aaai-characterizing/}
}