Journal article

On the complexity of single−rule datalog queries

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

Gottlob, G., & Papadimitriou, C. (2003). On the complexity of single−rule datalog queries. Inf. Comput., 183(1), 104–122.

MLA Style

Gottlob, G., and C. Papadimitriou. “On the Complexity of Single−Rule Datalog Queries.” Inf. Comput., vol. 183, no. 1, 2003, pp. 104–22.

Chicago Style

Gottlob, G, and C Papadimitriou. 2003. “On the Complexity of Single−Rule Datalog Queries.” Inf. Comput. 183 (1): 104–22.
Share
Print

Access Document

Publisher copy:: 10.1016/S0890-5401(03)00012-9

Authors

+ Gottlob, G More by this author

Role:: Author

+ Papadimitriou, C More by this author

Role:: Author

Journal:: Inf. Comput. More from this journal
Volume:: 183
Issue:: 1
Pages:: 104-122
Publication date:: 2003-01-01
DOI:: 10.1016/S0890-5401(03)00012-9

UUID:: uuid:aa9d7d27-53e1-4276-ac2d-8625e123aebe
Local pid:: cs:163
Deposit date:: 2015-03-31

Terms of use

Copyright date:: 2003

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