Logics for Unranked Trees: An Overview

Details Logics for Unranked Trees: An Overview Logics for Unranked Trees: An Overview

2006-06-13

arxiv.org/abs/cs/0606062v2

LMCS 2 (3:2) 2006

Computer Science

Logic in Computer Science

Scientific paper

10.2168/LMCS-2(3:2)2006

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.

Affiliated with

Also associated with

No associations

Rating

Logics for Unranked Trees: An Overview does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Logics for Unranked Trees: An Overview, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Logics for Unranked Trees: An Overview will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-45942