Conference item

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. (1999). On the Complexity of Single−Rule Datalog Queries. Logic Programming and Automated Reasoning‚ 6th International Conference‚ LPAR'99‚ Tbilisi‚ Georgia‚ September 6−10‚ 1999‚ Proceedings, 1705.

MLA Style

Gottlob, G., and C. Papadimitriou. “On the Complexity of Single−Rule Datalog Queries.” Logic Programming and Automated Reasoning‚ 6th International Conference‚ LPAR'99‚ Tbilisi‚ Georgia‚ September 6−10‚ 1999‚ Proceedings, vol. 1705, Springer, 1999.

Chicago Style

Gottlob, G, and C Papadimitriou. 1999. “On the Complexity of Single−Rule Datalog Queries.” In Logic Programming and Automated Reasoning‚ 6th International Conference‚ LPAR'99‚ Tbilisi‚ Georgia‚ September 6−10‚ 1999‚ Proceedings. Vol. 1705. Springer.
Share
Print

Authors

+ Gottlob, G More by this author

Role:: Author

+ Papadimitriou, C More by this author

Role:: Author

Publisher:: Springer
Host title:: Logic Programming and Automated Reasoning‚ 6th International Conference‚ LPAR'99‚ Tbilisi‚ Georgia‚ September 6−10‚ 1999‚ Proceedings
Volume:: 1705
Publication date:: 1999-01-01
ISBN:: 3540664920

UUID:: uuid:de527939-b128-4899-8120-94fea46af6b0
Local pid:: cs:213
Deposit date:: 2015-03-31

Terms of use

Copyright date:: 1999

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