Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

ICALP
2005
Springer

favoriteEmaildiscussreport

139views Programming Languages» more ICALP 2005»

Logics for Unranked Trees: An Overview

13 years 10 months ago

Logics for Unranked Trees: An Overview

Download homepages.inf.ed.ac.uk

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 signiﬁcantly 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.

Leonid Libkin

Real-time Traffic

ICALP 2005 | Navigational Properties | Such Logics | Theoretical Computer Science | Unranked Trees |

claim paper

Related Content

» Weighted Logics for Unranked Tree Automata

» Querying Unranked Trees with Stepwise Tree Automata

» Characterization of Logics over Ranked Tree Languages

» Forest Expressions

» Tuples Extraction from HTML Using Logic Wrappers and Inductive Logic Programming

» Automata and Logics for Unranked and Unordered Trees

» Temporal Logics over Unranked Trees

» Learning Logic Wrappers for Information Extraction from the Web

» Wreath Products of Forest Algebras with Applications to Tree Logics

Post Info
More Details (n/a)

Added	27 Jun 2010
Updated	27 Jun 2010
Type	Conference
Year	2005
Where	ICALP
Authors	Leonid Libkin

Comments (0)