Logics for Unranked Trees: An Overview

Add to your list(s) Download to your calendar using vCal

• Leonid Libkin, U of Edinburgh
• Wednesday 11 October 2006, 11:00-12:00
• Venue to be confirmed.

If you have a question about this talk, please contact Timothy G. Griffin.

This talk has been canceled/deleted

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 talk I present a survey of logics for unranked trees.

This talk is part of the Wednesday Seminars - Department of Computer Science and Technology series.

This talk is included in these lists:

Note that ex-directory lists are not shown.