Monadic Datalog Containment

DOI10.1007/978-3-642-31585-5_11MaRDI QIDQ3167001zbMATH OpenOpenAlexFDO

Authors Michael Benedikt, Pierre Bourhis, Pierre Senellart

Publication date 1 November 2012

Published in Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31585-5_11

Mathematics Subject Classification ID

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

Recommendations

• Monadic Datalog, tree validity, and limited access containment
• Containment of monadic Datalog programs via bounded clique-width
• Monadic Datalog over finite structures of bounded treewidth
• Datalog with Negation and Monotonicity.
• Monadic datalog and regular tree pattern queries
• Monadic datalog and regular tree pattern queries
• Weighted monadic Datalog
• Monadic Datalog Tree Transducers
• Monadic constraint programming
• Inference of monotonicity constraints in Datalog programs

Cited in

(10)

• Monadic datalog and regular tree pattern queries
• Decidable containment of recursive queries
• Eliminating recursion from monadic datalog programs on trees
• Datalog with Negation and Monotonicity.
• Monadic datalog and regular tree pattern queries
• Containment of monadic Datalog programs via bounded clique-width
• Conjunctive query containment over trees using schema information
• scientific article; zbMATH DE number 7561474 (Why is no real title available?)
• Evaluating Datalog via tree automata and cycluits
• Monadic Datalog, tree validity, and limited access containment

Describes a project that uses

Uses Software

• Datalog

This page was built for publication: Monadic Datalog Containment

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