Propositional default logics made easier: computational complexity of model checking - ORA - Oxford University Research Archive

Back to Search

Journal article

Propositional default logics made easier: computational complexity of model checking

Actions

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

-
Your message (optional)
Please add any additional information to be included within the email.
Cite

Cite this record

APA Style

Baumgartner, R., & Gottlob, G. (2016). Propositional default logics made easier: computational complexity of model checking. Theor. Comput. Sci., 289(1), 591–627.

MLA Style

Baumgartner, R., and G. Gottlob. “Propositional Default Logics Made Easier: Computational Complexity of Model Checking.” Theor. Comput. Sci., vol. 289, no. 1, 2016, pp. 591–627.

Chicago Style

Baumgartner, R, and G Gottlob. 2016. “Propositional Default Logics Made Easier: Computational Complexity of Model Checking.” Theor. Comput. Sci. 289 (1): 591–627.
Tweet
Print

Authors

+ Baumgartner, R More by this author

Role:

Author

+ Gottlob, G More by this author

Role:

Author

Bibliographic Details

Journal:: Theor. Comput. Sci.
Volume:: 289
Issue:: 1
Pages:: 591-627
Publication date:: 2002-01-01

Item Description

UUID:: uuid:6e9db257-b118-464d-a96d-59ac501ba222
Local pid:: cs:186
Deposit date:: 2015-03-31

Terms of use

Copyright date:: 2002

Licence:: Terms and Conditions of Use for Oxford University Research Archive

Metrics

Views and Downloads

About views and downloads

If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP