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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Datalog / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: XPath / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-662-47666-6_34 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2399482328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing Conjunctive Queries over Trees Using Schema Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive queries and context-free graph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds to the clique width of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree acceptors and some of their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic datalog and the expressive power of languages for Web information extraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic datalog over finite structures of bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learnability and definability in trees and similar structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Branch-Decompositions and Rank-Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic Datalog and Regular Tree Pattern Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of XPath containment in the presence of disjunction, DTDs, and variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence of Datalog queries is undecidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized finite automata theory with an application to a decision problem of second-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4219045 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:11, 11 July 2024

scientific article
Language Label Description Also known as
English
Containment of Monadic Datalog Programs via Bounded Clique-Width
scientific article

    Statements

    Containment of Monadic Datalog Programs via Bounded Clique-Width (English)
    0 references
    0 references
    0 references
    0 references
    4 November 2015
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references