Journal article

The Complexity of Default Reasoning under the Stationary Fixed Point Semantics

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.
Share
Cite

Cite this record

APA Style

Gottlob, G. (1995). The Complexity of Default Reasoning under the Stationary Fixed Point Semantics. Inf. Comput., 121(1), 81–92.

MLA Style

Gottlob, G. “The Complexity of Default Reasoning under the Stationary Fixed Point Semantics.” Inf. Comput., vol. 121, no. 1, 1995, pp. 81–92.

Chicago Style

Gottlob, G. 1995. “The Complexity of Default Reasoning under the Stationary Fixed Point Semantics.” Inf. Comput. 121 (1): 81–92.
Print

Access Document

Publisher copy:: 10.1006/inco.1995.1124

Authors

+ Gottlob, G More by this author

Role:: Author

Journal:: Inf. Comput. More from this journal
Volume:: 121
Issue:: 1
Pages:: 81-92
Publication date:: 1995-01-01
DOI:: 10.1006/inco.1995.1124
ISSN:: 0890-5401

UUID:: uuid:29443994-31ed-4f35-9ca9-212ac199708c
Local pid:: cs:257
Deposit date:: 2015-03-31
ARK identifier:: ark:/29072/ora_2944399431ed4f359ca9212ac199708c

Terms of use

Copyright date:: 1995

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

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