| |
VOLUME 2, ISSUE 3, PAPER 2
|
Logics for Unranked Trees: An Overview
|
©Leonid Libkin, U of Edinburgh and U of Toronto
|
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.
|
Publication date: July 26, 2006
Full Text: PDF | PostScript
DOI: 10.2168/LMCS-2(3:2)2006
Hit Counts: 5747 |
 Creative Commons | |
