Containment of monadic Datalog programs via bounded clique-width
From MaRDI portal
Recommendations
Cites work
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Equivalence of Datalog queries is undecidable
- Finding Branch-Decompositions and Rank-Decompositions
- Generalized finite automata theory with an application to a decision problem of second-order logic
- scientific article; zbMATH DE number 1223729 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- Learnability and definability in trees and similar structures
- Linear time solvable optimization problems on graphs of bounded clique-width
- Monadic datalog and regular tree pattern queries
- Monadic Datalog and the expressive power of languages for web information extraction
- Monadic Datalog over finite structures of bounded treewidth
- On the complexity of XPath containment in the presence of disjunction, DTDs, and variables
- Optimizing Conjunctive Queries over Trees Using Schema Information
- Recursive queries and context-free graph grammars
- Tree acceptors and some of their applications
- Upper bounds to the clique width of graphs
Cited in
(9)- Reasoning about integrity constraints for tree-structured data
- Conjunctive query containment over trees using schema information
- Monadic datalog and regular tree pattern queries
- Eliminating recursion from monadic datalog programs on trees
- Monadic Datalog over finite structures of bounded treewidth
- Monadic Datalog Containment
- On Bounded Database Schemes and Bounded Horn-Clause Programs
- Monadic Datalog, tree validity, and limited access containment
- Monadic datalog and regular tree pattern queries
This page was built for publication: Containment of monadic Datalog programs via bounded clique-width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3449494)
