Leonid Libkin - Logics for Unranked Trees: An Overview

lmcs:2244 - Logical Methods in Computer Science, July 26, 2006, Volume 2, Issue 3 - https://doi.org/10.2168/LMCS-2(3:2)2006
Logics for Unranked Trees: An OverviewArticle

Authors: Leonid Libkin ORCID

    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.

    Volume: Volume 2, Issue 3
    Published on: July 26, 2006
    Submitted on: August 31, 2005
    Keywords: Computer Science - Logic in Computer Science,Computer Science - Databases,H.2.3,H.2.1,I.7,F.2.3,F.4.1,F.4.3
      Source : OpenAIRE Graph
    • Funder: Natural Sciences and Engineering Research Council of Canada

    24 Documents citing this article

    Consultation statistics

    This page has been seen 1950 times.
    This article's PDF has been downloaded 508 times.