Logics for Unranked Trees: An Overview

Abstract

Labeled unranked trees are used as a model of XML documents, and logical languages for them have been studied actively over the past several years. Such logics have different purposes: some are better suited for extracting data, some for expressing navigational properties, and some make it easy to relate complex properties of trees to the existence of tree automata for those properties. Furthermore, logics differ significantly in their model-checking properties, their automata models, and their behavior on ordered and unordered trees. In this paper we present a survey of logics for unranked trees.

Cited by in corpus (8)

• First-Order and Temporal Logics for Nested Words
• Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure
• Complete Axiomatizations of Fragments of Monadic Second-Order Logic on Finite Trees
• CSS Minification via Constraint Solving (Technical Report)
• Extending Büchi Automata with Constraints on Data Values
• Learning XML Twig Queries
• A note on monadic datalog on unranked trees
• Regular families of forests, antichains and duality pairs of relational structures