BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Logics for Unranked Trees: An Overview - Leonid Libkin\, U of Edin
 burgh
DTSTART:20061011T100000Z
DTEND:20061011T110000Z
UID:TALK5366@talks.cam.ac.uk
CONTACT:Timothy G. Griffin
DESCRIPTION:Labeled unranked trees are used as a model of XML documents\, 
 and logical\nlanguages for them have been studied actively over the past s
 everal years.\nSuch logics have different purposes: some are better suited
  for extracting\ndata\, some for expressing navigational properties\, and 
 some make it easy\nto relate complex properties of trees to the existence 
 of tree automata\nfor those properties. Furthermore\, logics differ signif
 icantly in their\nmodel-checking properties\, their automata models\, and 
 their behavior on\nordered and unordered trees. In this talk I present a s
 urvey of logics\nfor unranked trees.
LOCATION:Venue to be confirmed
END:VEVENT
END:VCALENDAR