Containment of Monadic Datalog Programs via Bounded Clique-Width (Q3449494): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-662-47666-6_34
+Normal rank
@@ Property / OpenAlex ID @@
+W2399482328
@@ Property / OpenAlex ID: W2399482328 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4864249
@@ Property / cites work: Q4864249 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimizing Conjunctive Queries over Trees Using Schema Information
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+Recursive queries and context-free graph grammars
@@ Property / cites work: Recursive queries and context-free graph grammars / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time solvable optimization problems on graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+Upper bounds to the clique width of graphs
@@ Property / cites work: Upper bounds to the clique width of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Tree acceptors and some of their applications
@@ Property / cites work: Tree acceptors and some of their applications / rank @@
+Normal rank
@@ Property / cites work @@
+Monadic datalog and the expressive power of languages for Web information extraction
+Normal rank
@@ Property / cites work @@
+Monadic datalog over finite structures of bounded treewidth
+Normal rank
@@ Property / cites work @@
+Learnability and definability in trees and similar structures
+Normal rank
@@ Property / cites work @@
+Finding Branch-Decompositions and Rank-Decompositions
+Normal rank
@@ Property / cites work @@
+Monadic Datalog and Regular Tree Pattern Queries
@@ Property / cites work: Monadic Datalog and Regular Tree Pattern Queries / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of XPath containment in the presence of disjunction, DTDs, and variables
+Normal rank
@@ Property / cites work @@
+Equivalence of Datalog queries is undecidable
@@ Property / cites work: Equivalence of Datalog queries is undecidable / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized finite automata theory with an application to a decision problem of second-order logic
+Normal rank
@@ Property / cites work @@
+Q4219045
@@ Property / cites work: Q4219045 / rank @@
+Normal rank