On the Complexity of Model Checking for Propositional Default Logics: New Results and Tractable Cases

Cite

Text

Baumgartner and Gottlob. "On the Complexity of Model Checking for Propositional Default Logics: New Results and Tractable Cases." International Joint Conference on Artificial Intelligence, 1999.

Markdown

[Baumgartner and Gottlob. "On the Complexity of Model Checking for Propositional Default Logics: New Results and Tractable Cases." International Joint Conference on Artificial Intelligence, 1999.](https://mlanthology.org/ijcai/1999/baumgartner1999ijcai-complexity/)

BibTeX

@inproceedings{baumgartner1999ijcai-complexity,
  title     = {{On the Complexity of Model Checking for Propositional Default Logics: New Results and Tractable Cases}},
  author    = {Baumgartner, Robert and Gottlob, Georg},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {1999},
  pages     = {64-69},
  url       = {https://mlanthology.org/ijcai/1999/baumgartner1999ijcai-complexity/}
}