Navigating and Querying Answer Sets: How Hard Is It Really and Why?
Aus International Center for Computational Logic
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? Navigating and Querying Answer Sets: How Hard Is It Really and Why?](/w/images/thumb/e/e2/Missing_document_icon.png/150px-Missing_document_icon.png)
Dominik Rusovac, Markus Hecher, Martin Gebser, Sarah Alice Gaggl, Johannes K. Fichte
Navigating and Querying Answer Sets: How Hard Is It Really and Why?
Proceedings of KR 2024, to appear
Navigating and Querying Answer Sets: How Hard Is It Really and Why?
Proceedings of KR 2024, to appear
- Bemerkung: Note: to appear
- Projekt:Project: NAVAS, SECAI
- Forschungsgruppe:Research Group: Logische Programmierung und ArgumentationLogic Programming and Argumentation
@article{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?},
journal = {Proceedings of {KR} 2024},
year = {2024}
}