Logics for unranked trees: An overview

DOI10.1007/11523468_4MaRDI QIDQ5716799zbMATH OpenOpenAlexFDO

Authors Leonid Libkin

Publication date 10 January 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11523468, http://hdl.handle.net/20.500.11820/19933431-6bbe-469f-a1e2-fc9a2c6a1c18

zbMATH Keywords

survey

Mathematics Subject Classification ID

Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Data structures (68P05) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Logics for Unranked Trees: An Overview
• Logical definability and query languages over ranked and unranked trees
• Automata, logic, and XML
• Automata and logics for unranked and unordered trees
• XML schema, tree logic and sheaves automata

Cited in

(12)

• Weighted logics for unranked tree automata
• Logics for Unordered Trees with Data Constraints on Siblings
• Weighted unranked tree automata over tree valuation monoids and their characterization by weighted logics
• Characterization of Logics over Ranked Tree Languages
• Pattern logics and auxiliary relations
• Logical definability and query languages over ranked and unranked trees
• Logics for Unranked Trees: An Overview
• Automata and logics for unranked and unordered trees
• Ramsey quantifiers over automatic structures: complexity and applications to verification
• Regular families of forests, antichains and duality pairs of relational structures
• Automata for XML -- a survey
• Reasoning about XML with temporal logics and automata

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 Q5716799)