Journal article

Monadic datalog, tree validity, and limited access containment

Publication status:: Published

Peer review status:: Peer reviewed

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

Benedikt, M., Bourhis, P., Gottlob, G., & Senellart, P. (2019). Monadic datalog, tree validity, and limited access containment. ACM Transactions on Computational Logic, 21(1).

MLA Style

Benedikt, M., et al. “Monadic Datalog, Tree Validity, and Limited Access Containment.” ACM Transactions on Computational Logic, vol. 21, no. 1, Association for Computing Machinery, 2019.

Chicago Style

Benedikt, M, P Bourhis, G Gottlob, and P Senellart. 2019. “Monadic Datalog, Tree Validity, and Limited Access Containment.” ACM Transactions on Computational Logic 21 (1).
Share
Print

Access Document

Files:: mdl.pdf

(Preview, Accepted manuscript, pdf, 1.0MB, Terms of use)

Publisher copy:: 10.1145/3344514

Authors

+ Benedikt, M More by this author

Institution:: University of Oxford
Division:: MPLS
Department:: Computer Science
Oxford college:: University College
Role:: Author

+ Bourhis, P More by this author

Role:: Author

+ Gottlob, G More by this author

Institution:: University of Oxford
Division:: MPLS Division
Department:: Computer Science
Role:: Author

+ Senellart, P More by this author

Role:: Author

+ Engineering and Physical Sciences Research Council More from this funder

Grant:: EP/M005852/1

Publisher:: Association for Computing Machinery
Journal:: ACM Transactions on Computational Logic More from this journal
Volume:: 21
Issue:: 1
Article number:: 6
Publication date:: 2019-10-04
Acceptance date:: 2019-07-04
DOI:: 10.1145/3344514
EISSN:: 1557-945X
ISSN:: 1529-3785

Keywords:: FFR
Pubs id:: pubs:1049146
UUID:: uuid:4f6fcbe8-61ad-4ac8-bae1-646c1b68db8a
Local pid:: pubs:1049146
Source identifiers:: 1049146
Deposit date:: 2019-09-04

Terms of use

Copyright date:: 2019
Notes:: This is an author version of the article. The final version is available online from the publisher’s website.

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