On regular paths with counting and data tests
From MaRDI portal
Publication:1744429
DOI10.1016/j.entcs.2016.11.002zbMath1394.68108OpenAlexW2563722128WikidataQ113317624 ScholiaQ113317624MaRDI QIDQ1744429
Everardo Bárcenas, Jesús Lavalle, Edgard Benítez-Guerrero
Publication date: 23 April 2018
Full work available at URL: https://doi.org/10.1016/j.entcs.2016.11.002
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Complete axiomatizations for XPath fragments
- Complexity of modal logics with Presburger constraints
- FO2(<,+1,~) on data trees, data tree automata and branching vector addition systems
- Model Theory of XPath on Data Trees. Part I: Bisimulation and Characterization
- Two-variable logic on data words
- Decidability of Downward XPath
- Reasoning with Global Assumptions in Arithmetic Modal Logics
- Toward Model Theory with Data Values
- Two-variable logic on data trees and XML reasoning
- A logic you can count on
- Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories
- Global Numerical Constraints on Trees
This page was built for publication: On regular paths with counting and data tests
