Navigating and Querying Answer Sets: How Hard Is It Really and Why?

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche

Toggle side column

Navigating and Querying Answer Sets: How Hard Is It Really and Why?

Dominik RusovacDominik Rusovac,  Markus HecherMarkus Hecher,  Martin GebserMartin Gebser,  Sarah Alice GagglSarah Alice Gaggl,  Johannes K. FichteJohannes K. Fichte
Navigating and Querying Answer Sets: How Hard Is It Really and Why?


Slides: Navigating and Querying Answer Sets: How Hard Is It Really and Why?

Dominik Rusovac, Markus Hecher, Martin Gebser, Sarah Alice Gaggl, Johannes K. Fichte
Navigating and Querying Answer Sets: How Hard Is It Really and Why?
In Pierre Marquis, Magdalena Ortiz, Maurice Pagnucco, eds., Proceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning (KR 2024), 642–653, November 2024. IJCAI Organization
@inproceedings{RHGGF2024,
  author    = {Dominik Rusovac and Markus Hecher and Martin Gebser and Sarah
               Alice Gaggl and Johannes K. Fichte},
  title     = {Navigating and Querying Answer Sets: How Hard Is It Really and
               Why?},
  editor    = {Pierre Marquis and Magdalena Ortiz and Maurice Pagnucco},
  booktitle = {Proceedings of the 21st International Conference on Principles of
               Knowledge Representation and Reasoning (KR 2024)},
  publisher = {IJCAI Organization},
  year      = {2024},
  month     = {November},
  pages     = {642{\textendash}653},
  doi       = {https://doi.org/10.24963/kr.2024/60}
}