Pages that link to "Item:Q3452211"
From MaRDI portal
The following pages link to Two-variable logic on data trees and XML reasoning (Q3452211):
Displaying 37 items.
- Deciding twig-definability of node selecting tree automata (Q269327) (← links)
- The reachability problem for branching vector addition systems requires doubly-exponential space (Q407525) (← links)
- Walking on data words (Q504989) (← links)
- Structural characterizations of the navigational expressiveness of relation algebras on a tree (Q896017) (← links)
- Model checking memoryful linear-time logics over one-counter automata (Q974117) (← links)
- Reasoning about XML with temporal logics and automata (Q975873) (← links)
- Reasoning about integrity constraints for tree-structured data (Q1650919) (← links)
- Conjunctive query containment over trees using schema information (Q1702301) (← links)
- An automata-theoretic approach to the verification of distributed algorithms (Q1706162) (← links)
- On regular paths with counting and data tests (Q1744429) (← links)
- Characterizations for \(\mathrm{XPath}_{\mathcal{R}}(\downarrow)\) (Q2148804) (← links)
- Emptiness and finiteness for tree automata with global reflexive disequality constraints (Q2351395) (← links)
- Model theory of XPath on data trees. II: Binary bisimulation and definability (Q2401631) (← links)
- Axiomatizations for downward XPath on data trees (Q2402362) (← links)
- Reasoning about functional and full hierarchical dependencies over partial relations (Q2446453) (← links)
- Complexity results on register context-free grammars and related formalisms (Q2672616) (← links)
- Regular Programming for Quantitative Properties of Data Streams (Q2802466) (← links)
- Hilbert-Style Axiomatization for Hybrid XPath with Data (Q2835860) (← links)
- Testing XML constraint satisfiability (Q2867947) (← links)
- Nonelementary Complexities for Branching VASS, MELL, and Extensions (Q2946760) (← links)
- Logics of Repeating Values on Data Trees and Branching Counter Systems (Q2988368) (← links)
- Variable Tree Automata over Infinite Ranked Alphabets (Q3014945) (← links)
- Future-Looking Logics on Data Words and Trees (Q3182936) (← links)
- XML Schema Mappings (Q3189647) (← links)
- On Synthesis of Specifications with Arithmetic (Q3297765) (← links)
- Forward analysis for WSTS, part I: completions (Q3386750) (← links)
- Complexity of Data Tree Patterns over XML Documents (Q3599134) (← links)
- Logical Foundations of XML and XQuery (Q3638998) (← links)
- (Q5089315) (← links)
- (Q5094127) (← links)
- (Q5155666) (← links)
- Expressive Completeness of Separation Logic with Two Variables and No Separating Conjunction (Q5277913) (← links)
- Two-Variable Logic with Counting and Trees (Q5278191) (← links)
- Complexity of Two-Variable Logic on Finite Trees (Q5278193) (← links)
- Extending two-variable logic on data trees with order on data values and its automata (Q5410335) (← links)
- (Q5875386) (← links)
- (Q5875390) (← links)
