BEGIN:VCALENDAR
VERSION:2.0
PRODID:ILLC Website
X-WR-TIMEZONE:Europe/Amsterdam
BEGIN:VTIMEZONE
TZID:Europe/Amsterdam
X-LIC-LOCATION:Europe/Amsterdam
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19700329T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19701025T030000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:/NewsandEvents/Archives/2006/newsitem/1047/27-
 February---3-March-2006-Logic-and-Databases-Isaac-
 Newton-Institute-for-Mathematical-Sciences-Cambrid
 ge-UK
DTSTAMP:20051103T000000
SUMMARY:Logic and Databases, Isaac Newton Institut
 e for Mathematical Sciences, Cambridge, UK
DTSTART;VALUE=DATE:20060227
DTEND;VALUE=DATE:20060303
LOCATION:Isaac Newton Institute for Mathematical S
 ciences, Cambridge, UK
DESCRIPTION:Logic and databases have been intimate
 ly linked since the rise of relational database sy
 stems in the 1970s. Relational databases can be mo
 delled by finite relational structures, and first-
 order logic lies at the core of standard database 
 query languages such as the Structured Query Langu
 age, SQL. As another example, closer to current re
 search, XML documents can be modelled by labelled 
 unranked trees, and XML query languages as logics 
 on trees.    The workshop will focus on recent res
 earch on logical aspects of the theory of database
  systems. These include the applications of logic 
 and logical methods in the study of databases as w
 ell as questions in logic that arise from this stu
 dy. Particular topics of interest include the expr
 essive power and complexity of query languages; mo
 dels and languages for semi-structured data; proba
 bilistic databases; constraint databases, etc.    
 For more information, see http://www.newton.cam.ac
 .uk/programmes/LAA/laaw02.html
X-ALT-DESC;FMTTYPE=text/html:\n      <p>\n        
 Logic and databases have been intimately linked si
 nce\n        the rise of relational database syste
 ms in the 1970s. Relational databases\n        can
  be modelled by finite relational structures, and 
 first-order logic\n        lies at the core of sta
 ndard database query languages such as the\n      
   Structured Query Language, SQL. As another examp
 le, closer to current\n        research, XML docum
 ents can be modelled by labelled unranked trees, a
 nd\n        XML query languages as logics on trees
 .\n      </p>\n      <p>\nThe workshop will focus 
 on recent research on logical aspects of the theor
 y of database systems. These include the applicati
 ons of logic and logical methods in the study of d
 atabases as well as questions in logic that arise 
 from this study. Particular topics of interest inc
 lude the expressive power and complexity of query 
 languages; models and languages for semi-structure
 d data; probabilistic databases; constraint databa
 ses, etc.\n      </p>\n    \n      <p>\n        Fo
 r more information, see\n        <a target="_blank
 " href="http://www.newton.cam.ac.uk/programmes/LAA
 /laaw02.html">http://www.newton.cam.ac.uk/programm
 es/LAA/laaw02.html</a>\n      </p>\n    
URL:/NewsandEvents/Archives/2006/newsitem/1047/27-
 February---3-March-2006-Logic-and-Databases-Isaac-
 Newton-Institute-for-Mathematical-Sciences-Cambrid
 ge-UK
END:VEVENT
END:VCALENDAR