Containment of monadic Datalog programs via bounded clique-width
DOI10.1007/978-3-662-47666-6_34zbMATH Open1440.68054OpenAlexW2399482328MaRDI QIDQ3449494FDOQ3449494
Authors: Mikołaj Bojańczyk, Filip Murlak, Adam Witkowski 
Publication date: 4 November 2015
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-47666-6_34
Recommendations
Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Logic programming (68N17) Database theory (68P15) Logic in computer science (03B70)
Cites Work
- Title not available (Why is that?)
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Linear time solvable optimization problems on graphs of bounded clique-width
- Upper bounds to the clique width of graphs
- On the complexity of XPath containment in the presence of disjunction, DTDs, and variables
- Monadic Datalog and the expressive power of languages for web information extraction
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Title not available (Why is that?)
- Equivalence of Datalog queries is undecidable
- Optimizing Conjunctive Queries over Trees Using Schema Information
- Finding Branch-Decompositions and Rank-Decompositions
- Tree acceptors and some of their applications
- Monadic Datalog over finite structures of bounded treewidth
- Recursive queries and context-free graph grammars
- Learnability and definability in trees and similar structures
- Monadic datalog and regular tree pattern queries
Cited In (9)
- Monadic datalog and regular tree pattern queries
- Eliminating recursion from monadic datalog programs on trees
- Monadic Datalog Containment
- Monadic Datalog over finite structures of bounded treewidth
- Reasoning about integrity constraints for tree-structured data
- Monadic datalog and regular tree pattern queries
- Conjunctive query containment over trees using schema information
- On Bounded Database Schemes and Bounded Horn-Clause Programs
- Monadic Datalog, tree validity, and limited access containment
Uses Software
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)
