Logics for Unranked Trees: An Overview

DOI10.2168/LMCS-2(3:2)2006MaRDI QIDQ5310661zbMATH OpenFDO

Authors Leonid Libkin

Publication date 11 October 2007

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2168/LMCS-2(3:2)2006

Mathematics Subject Classification ID

Logic in computer science (03B70) Database theory (68P15) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Automata, Languages and Programming
• Logical definability and query languages over ranked and unranked trees
• scientific article; zbMATH DE number 1948151
• Term Rewriting and Applications
• scientific article; zbMATH DE number 2043533

Cited in

(17)

• Bottom-up unranked tree-to-graph transducers for translation into semantic graphs
• Regular expressions for data words
• Weighted logics for unranked tree automata
• Logics for Unordered Trees with Data Constraints on Siblings
• Capturing MSO with one quantifier
• Tree Automata with Global Constraints
• Tree Pattern Rewriting Systems
• Characterization of Logics over Ranked Tree Languages
• scientific article; zbMATH DE number 1948151 (Why is no real title available?)
• Pattern logics and auxiliary relations
• Temporal logics for concurrent recursive programs: satisfiability and model checking
• Streamable fragments of forward XPath
• Logical definability and query languages over ranked and unranked trees
• Automata, Languages and Programming
• Rewriting Techniques and Applications
• A Büchi-like theorem for weighted tree automata over multioperator monoids
• Dominance constraints in stratified context unification

This page was built for publication: Logics for Unranked Trees: An Overview

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