Complexity Results for Propositional Closed World Reasoning and Circumscription from Tractable Knowledge Bases

Cite

Text

Coste-Marquis and Marquis. "Complexity Results for Propositional Closed World Reasoning and Circumscription from Tractable Knowledge Bases." International Joint Conference on Artificial Intelligence, 1999.

Markdown

[Coste-Marquis and Marquis. "Complexity Results for Propositional Closed World Reasoning and Circumscription from Tractable Knowledge Bases." International Joint Conference on Artificial Intelligence, 1999.](https://mlanthology.org/ijcai/1999/costemarquis1999ijcai-complexity/)

BibTeX

@inproceedings{costemarquis1999ijcai-complexity,
  title     = {{Complexity Results for Propositional Closed World Reasoning and Circumscription from Tractable Knowledge Bases}},
  author    = {Coste-Marquis, Sylvie and Marquis, Pierre},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {1999},
  pages     = {24-29},
  url       = {https://mlanthology.org/ijcai/1999/costemarquis1999ijcai-complexity/}
}