On regular paths with counting and data tests

DOI10.1016/J.ENTCS.2016.11.002MaRDI QIDQ1744429zbMATH OpenOpenAlexWikidataFDO

Authors Everardo Bárcenas, Edgard Benítez-Guerrero, Jesús Lavalle

Publication date 23 April 2018

Full work available at URL https://doi.org/10.1016/j.entcs.2016.11.002

zbMATH Keywords

countingmodal logicsdata treesautomated reasoningXPath

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Database theory (68P15)

Recommendations

• Model theory of XPath on data trees. I: Bisimulation and characterization
• On decidability of boundedness property for regular path queries
• An extension of data automata that captures XPath
• Counting in trees
• Axiomatizations for downward XPath on data trees

Cites work

• scientific article; zbMATH DE number 5999538 (Why is no real title available?)
• A logic you can count on
• Complete axiomatizations for XPath fragments
• Complexity of modal logics with Presburger constraints
• Counting in trees
• Decidability of downward XPath
• Decidable classes of tree automata mixing local and global constraints modulo flat theories
• Global numerical constraints on trees
• Model theory of XPath on data trees. I: Bisimulation and characterization
• Reasoning with global assumptions in arithmetic modal logics
• Toward model theory with data values
• Two-variable logic on data trees and XML reasoning
• Two-variable logic on data words
• \(\mathsf{FO}^2(<,+1,\sim)\) on data trees, data tree automata and branching vector addition systems

Cited in

(2)

• Database Theory - ICDT 2005
• An extension of data automata that captures XPath

Describes a project that uses

Uses Software

• XPath

This page was built for publication: On regular paths with counting and data tests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1744429)