Complexity Results for Propositional Closed World Reasoning and Circumscription from Tractable Knowledge Bases
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence. .
Abstract
Sylvie Coste-Marquis, and Pierre Marquis. 1999. Complexity Results for Propositional Closed World Reasoning and Circumscription from Tractable Knowledge Bases. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI-99. IJCAI, https://ijcai.org/proceedings/1999/4
Coste-Marquis, S., & Marquis, P. (1999). Complexity Results for Propositional Closed World Reasoning and Circumscription from Tractable Knowledge Bases. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI-99. IJCAI. https://ijcai.org/proceedings/1999/4
@inproceedings{ijcai1999p4,
title = {Complexity Results for Propositional Closed World Reasoning and Circumscription from Tractable Knowledge Bases},
author = {Coste-Marquis, Sylvie and Marquis, Pierre},
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/4},
}
TY - CPAPER TI - Complexity Results for Propositional Closed World Reasoning and Circumscription from Tractable Knowledge Bases AU - Coste-Marquis, Sylvie AU - Marquis, Pierre 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/4 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
