Preferred Arguments are Harder to Compute than Stable Extension
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence. .
Abstract
Yannis Dimopoulos, Bernhard Nebel, and Francesca Toni. 1999. Preferred Arguments are Harder to Compute than Stable Extension. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI-99. IJCAI, https://ijcai.org/proceedings/1999/6
Dimopoulos, Y., Nebel, B., & Toni, F. (1999). Preferred Arguments are Harder to Compute than Stable Extension. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI-99. IJCAI. https://ijcai.org/proceedings/1999/6
@inproceedings{ijcai1999p6,
title = {Preferred Arguments are Harder to Compute than Stable Extension},
author = {Dimopoulos, Yannis and Nebel, Bernhard and Toni, Francesca},
booktitle = {Proceedings of the Sixteenth International Joint Conference on
Artificial Intelligence, {IJCAI-99}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Thomas Dean},
year = {1999},
url = {https://ijcai.org/proceedings/1999/6},
}
TY - CPAPER TI - Preferred Arguments are Harder to Compute than Stable Extension AU - Dimopoulos, Yannis AU - Nebel, Bernhard AU - Toni, Francesca T2 - Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI-99 PB - International Joint Conferences on Artificial Intelligence PY - 1999 UR - https://ijcai.org/proceedings/1999/6 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
