Monadic Datalog, tree validity, and limited access containment

DOI10.1145/3344514MaRDI QIDQ4972170zbMATH OpenOpenAlexWikidataFDO

Authors Michael Benedikt, Pierre Bourhis, Georg Gottlob, Pierre Senellart

Publication date 22 November 2019

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL https://ora.ox.ac.uk/objects/uuid:4f6fcbe8-61ad-4ac8-bae1-646c1b68db8a

zbMATH Keywords

access patternsbinding patternsdeep webmonadic Datalogquery containment

Mathematics Subject Classification ID

Logic programming (68N17) Database theory (68P15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Monadic Datalog Containment
• Containment of monadic Datalog programs via bounded clique-width
• Monadic datalog and regular tree pattern queries
• Monadic datalog and regular tree pattern queries
• Decidable containment of recursive queries

Cited in

(7)

• Evaluating Datalog via tree automata and cycluits
• Monadic datalog and regular tree pattern queries
• Monadic Datalog Containment
• Containment of monadic Datalog programs via bounded clique-width
• Monadic datalog and regular tree pattern queries
• Decidable containment of recursive queries
• On Monotonic Determinacy and Rewritability for Recursive Queries and Views

This page was built for publication: Monadic Datalog, tree validity, and limited access containment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4972170)