Comparing the succinctness of monadic query languages over finite trees (Q4659888): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2136195897 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>n</i> ! lower bound on formula size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability logic: an efficient fragment of transitive closure logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure and complexity of relational queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-order logic with two variables and unary temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic generalized spectra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472431 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of first-order and monadic second-order logic revisited / 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: On logics with two variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Science Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The succinctness of first-order logic on linear orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Query automata over finite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4219045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501666 / rank
 
Normal rank

Latest revision as of 19:59, 7 June 2024

scientific article; zbMATH DE number 2148225
Language Label Description Also known as
English
Comparing the succinctness of monadic query languages over finite trees
scientific article; zbMATH DE number 2148225

    Statements

    Comparing the succinctness of monadic query languages over finite trees (English)
    0 references
    0 references
    0 references
    0 references
    21 March 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    monadic second-order logic
    0 references
    monadic least fixed point logic
    0 references
    full modal mu-calculus
    0 references
    stratified monadic datalog
    0 references
    monadic datalog
    0 references
    finite automata on labelled finite trees
    0 references
    0 references