Future-Looking Logics on Data Words and Trees (Q3182936): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: XPath satisfiability in the presence of DTDs / 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: Two-variable logic on data trees and XML reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-variable logic on data words / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algebraic approach to data languages and timed languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Data Tree Patterns over XML Documents / rank
 
Normal rank
Property / cites work
 
Property / cites work: LTL with the freeze quantifier and register automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the freeze quantifier in Constraint LTL: Decidability and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Database Programming Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Software Science and Computation Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying lossy channel systems has nonprimitive recursive complexity. / rank
 
Normal rank

Latest revision as of 02:13, 2 July 2024

scientific article
Language Label Description Also known as
English
Future-Looking Logics on Data Words and Trees
scientific article

    Statements

    Future-Looking Logics on Data Words and Trees (English)
    0 references
    0 references
    0 references
    16 October 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references