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/1027/16-
January---7-July-2006-Logic-and-Algorithms
DTSTAMP:20051208T000000
SUMMARY:Logic and Algorithms
DTSTART;VALUE=DATE:20060116
DTEND;VALUE=DATE:20060707
LOCATION:Isaac Newton Institute for Mathematical S
ciences
DESCRIPTION:Theoretical Computer Science is broadl
y divided into disciplines dealing with logic, sem
antics and formal methods on the one hand, and alg
orithmics and computational complexity on the othe
r. The Newton Institute Semester Programme will fo
cus on active areas of research that cut across th
is divide, dealing with algorithmic and complexity
aspects of logic as well as logical methods in co
mplexity. Satellite workshops include 'Workshop
on Finite and Algorithmic Model Theory', 'Logic an
d Databases', 'Mathematics of Constraint Satisfact
ion', 'New Directions in Proof Complexity', 'Const
aints and Verification' and 'Games and Verificatio
n'. For more information, see here or http://ww
w.newton.cam.ac.uk/programmes/LAA/
X-ALT-DESC;FMTTYPE=text/html:\n \n
Theoretical Computer Science is broadly divided in
to disciplines dealing\n with logic, semant
ics and formal methods on the one hand, and algori
thmics\n and computational complexity on th
e other.\n The Newton Institute Semester Pr
ogramme will focus on\n active areas of res
earch that cut across this divide, dealing with\n
algorithmic and complexity aspects of logic
as well as logical methods in\n complexity
.\n

\n Satellite workshops includ
e 'Workshop on Finite and Algorithmic Model Theory
', 'Logic and Databases', 'Mathematics of Constrai
nt Satisfaction', 'New Directions in Proof Complex
ity', 'Constaints and Verification' and 'Games and
Verification'.\n

\n \n \n
For more information, see here or\n http://www.newton.cam.ac.uk/programmes/LA
A/\n

\n
URL:/NewsandEvents/Archives/2006/newsitem/1027/16-
January---7-July-2006-Logic-and-Algorithms
END:VEVENT
END:VCALENDAR