ML Anthology

It's Not My Default: The Complexity of Membership Problems in Restricted Propositional Default Logics

Jonathan Stillman
AAAI 1990 pp. 571-578
/aaai/1990/stillman1990aaai-my/

Abstract

We investigate the computational complexity of membership problems in a number of propositional default logics. We introduce a hierarchy of classes of propositional default rules that extends that described in [Kautz and Selman 1989], and characterize the complexity of membership problems in these classes under various simplifying assumptions about the underlying propositional theory. Our work significantly extends both that presented in [Kautz and Selman 1989] and in [Stillman 1990a].

PDF AAAI Semantic Scholar

Cite

Text

Stillman. "It's Not My Default: The Complexity of Membership Problems in Restricted Propositional Default Logics." AAAI Conference on Artificial Intelligence, 1990.

Markdown

[Stillman. "It's Not My Default: The Complexity of Membership Problems in Restricted Propositional Default Logics." AAAI Conference on Artificial Intelligence, 1990.](https://mlanthology.org/aaai/1990/stillman1990aaai-my/)

BibTeX

@inproceedings{stillman1990aaai-my,
  title     = {{It's Not My Default: The Complexity of Membership Problems in Restricted Propositional Default Logics}},
  author    = {Stillman, Jonathan},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {1990},
  pages     = {571-578},
  url       = {https://mlanthology.org/aaai/1990/stillman1990aaai-my/}
}