Logical definability and query languages over ranked and unranked trees

DOI10.1145/1227839.1227843MaRDI QIDQ5277776zbMATH OpenOpenAlexFDO

Authors Michael Benedikt, Frank Neven, Leonid Libkin

Publication date 12 July 2017

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1227839.1227843

zbMATH Keywords

model theoryquery languagesranked treestree automataunranked trees

Mathematics Subject Classification ID

Logic in computer science (03B70) Applications of model theory (03C98) Automata and formal grammars in connection with logical questions (03D05) Data structures (68P05) Database theory (68P15)

Recommendations

• Characterization of Logics over Ranked Tree Languages
• On deciding well-definedness for query languages on trees
• Logics for Unranked Trees: An Overview
• Automata, Languages and Programming
• Quantifier hierarchies over the first-order definable tree languages
• Logics for unordered trees with data constraints
• scientific article; zbMATH DE number 4035104
• scientific article; zbMATH DE number 3888931
• Term Rewriting and Applications
• scientific article; zbMATH DE number 2219131

Cited in

(13)

• Query automata over finite trees
• Highly expressive query languages for unordered data trees
• Logics for Unordered Trees with Data Constraints on Siblings
• Weak Kripke structures and LTL
• Definable relations and first-order query languages over strings
• Characterization of Logics over Ranked Tree Languages
• On deciding well-definedness for query languages on trees
• A syntactic characterization of bounded-rank decision trees in terms of decision lists
• scientific article; zbMATH DE number 1759452 (Why is no real title available?)
• Logics for Unranked Trees: An Overview
• Queries on XML streams with bounded delay and concurrency
• Automata, Languages and Programming
• Regular languages of nested words: fixed points, automata, and synchronization

This page was built for publication: Logical definability and query languages over ranked and unranked trees

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