Logics for Unranked Trees: An Overview
From MaRDI portal
Publication:5310661
DOI10.2168/LMCS-2(3:2)2006zbMath1126.03039MaRDI QIDQ5310661
Publication date: 11 October 2007
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Database theory (68P15) Formal languages and automata (68Q45) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (10)
Dominance constraints in stratified context unification ⋮ Capturing MSO with One Quantifier ⋮ Weighted logics for unranked tree automata ⋮ Tree Automata with Global Constraints ⋮ Tree Pattern Rewriting Systems ⋮ Temporal logics for concurrent recursive programs: satisfiability and model checking ⋮ A Büchi-like theorem for weighted tree automata over multioperator monoids ⋮ Bottom-up unranked tree-to-graph transducers for translation into semantic graphs ⋮ Streamable Fragments of Forward XPath ⋮ Regular expressions for data words
This page was built for publication: Logics for Unranked Trees: An Overview
