Two-variable logic on data trees and XML reasoning
From MaRDI portal
Publication:3452211
DOI10.1145/1516512.1516515zbMATH Open1325.68078OpenAlexW2053455078MaRDI QIDQ3452211FDOQ3452211
Authors: Mikołaj Bojańczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin 
Publication date: 11 November 2015
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1516512.1516515
Recommendations
- On the satisfiability of two-variable logic over data words
- Complexity of two-variable logic on finite trees
- Complexity of two-variable logic on finite trees
- Alternating automata on data trees and XPath satisfiability
- Extending two-variable logic on data trees with order on data values and its automata
Cited In (50)
- Title not available (Why is that?)
- Emptiness and finiteness for tree automata with global reflexive disequality constraints
- The reachability problem for branching vector addition systems requires doubly-exponential space
- Title not available (Why is that?)
- Deciding twig-definability of node selecting tree automata
- Model checking memoryful linear-time logics over one-counter automata
- Regular Programming for Quantitative Properties of Data Streams
- On reasoning about structural equality in XML: a description logic approach
- On regular paths with counting and data tests
- Forward analysis for WSTS, part I: completions
- On the satisfiability of local first-order logics with data
- Complexity of two-variable logic on finite trees
- Variable tree automata over infinite ranked alphabets
- Hilbert-style axiomatization for hybrid XPath with data
- Expressive completeness of separation logic with two variables and no separating conjunction
- Logics of repeating values on data trees and branching counter systems
- Characterizations for \(\mathrm{XPath}_{\mathcal{R}}(\downarrow)\)
- Set augmented finite automata over infinite alphabets
- Reasoning about integrity constraints for tree-structured data
- Model theory of XPath on data trees. II: Binary bisimulation and definability
- Title not available (Why is that?)
- Reasoning about XML with Temporal Logics and Automata
- XPath and modal logics of finite DAG's
- Axiomatizations for downward XPath on data trees
- Future-Looking Logics on Data Words and Trees
- Conjunctive query containment over trees using schema information
- Structural characterizations of the navigational expressiveness of relation algebras on a tree
- Reasoning about XML with temporal logics and automata
- Complexity of Data Tree Patterns over XML Documents
- Global numerical constraints on trees
- Extending two-variable logic on data trees with order on data values and its automata
- Complexity results on register context-free grammars and related formalisms
- Complexity of two-variable logic on finite trees
- On the existential fragments of local first-order logics with data
- Two-variable logic with counting and trees
- Title not available (Why is that?)
- XML schema mappings, data exchange and metadata management
- Walking on data words
- On synthesis of specifications with arithmetic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Logical Foundations of XML and XQuery
- Satisfiability of a Spatial Logic with Tree Variables
- Reasoning about functional and full hierarchical dependencies over partial relations
- An automata-theoretic approach to the verification of distributed algorithms
- Learning deterministic variable automata over infinite alphabets
- Testing XML constraint satisfiability
- Data graphs with incomplete information (and a way to complete them)
- On the satisfiability of two-variable logic over data words
- Title not available (Why is that?)
This page was built for publication: Two-variable logic on data trees and XML reasoning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452211)
