Logical definability and query languages over ranked and unranked trees
From MaRDI portal
Publication:5277776
DOI10.1145/1227839.1227843zbMath1367.03050OpenAlexW2044842674MaRDI QIDQ5277776
Michael Benedikt, Frank Neven, Leonid O. 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
Database theory (68P15) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Data structures (68P05) Applications of model theory (03C98)
Related Items (3)
Regular languages of nested words: fixed points, automata, and synchronization ⋮ Queries on XML streams with bounded delay and concurrency ⋮ Weak Kripke Structures and LTL
This page was built for publication: Logical definability and query languages over ranked and unranked trees