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/2016/newsitem/7319/21-
 23-June-2016-Tutorial-Definability-and-Complexity-
 of-Counting-Logics-
DTSTAMP:20160421T000000
SUMMARY:Tutorial "Definability and Complexity of C
 ounting Logics"
ATTENDEE;ROLE=Speaker:Anuj Dawar (Cambridge)
DTSTART;VALUE=DATE:20160621
DTEND;VALUE=DATE:20160623
LOCATION:Room F1.15, ILLC, Science Park 107, Amste
 rdam
DESCRIPTION:Anuj Dawar, who is visiting from Cambr
 idge, will give a three-part tutorial on 'Definabi
 lity and Complexity of Counting Logics'.  Part 1 (
 21 June 13:00-15:00) covers first-order logic with
  counting, fixed-point logic with counting, relati
 ons to complexity, and definability of constraint 
 satisfaction problems.  Literature: Albert Atseria
 s, Andrei A. Bulatov, Anuj Dawar: Affine systems o
 f equations and counting infinitary logic. Theor. 
 Comput. Sci. 410(18): 1666-1683 (2009)  Part 2 (22
  June 13:00-15:00) covers combinatorial optimizati
 on problems and their linear programming relaxatio
 ns and issues of symmetry and definability.  Liter
 ature: Matthew Anderson, Anuj Dawar, Bjarki Holm, 
 Solving Linear Programs without Breaking Abstracti
 ons, J. ACM 62(6): 48 (2015)  Part 3 (23 June 11:0
 0-14:00) covers the relationship between definabil
 ity and circuit complexity for first-order logic, 
 fixed-point logic and counting logics.  Literature
 : Matthew Anderson, Anuj Dawar: On Symmetric Circu
 its and Fixed-Point Logics. STACS 2014: 41-52  For
  more information, please contact bloewe at scienc
 e.uva.nl
X-ALT-DESC;FMTTYPE=text/html:\n        <p>Anuj Daw
 ar, who is visiting from Cambridge, will give a th
 ree-part tutorial on 'Definability and Complexity 
 of Counting Logics'.</p>\n        <p>Part 1 (21 Ju
 ne 13:00-15:00) covers first-order logic with coun
 ting, fixed-point logic with counting, relations t
 o complexity, and definability of constraint satis
 faction problems.<br/>\n          Literature: Albe
 rt Atserias, Andrei A. Bulatov, Anuj Dawar: Affine
  systems of equations and counting infinitary logi
 c. Theor. Comput. Sci. 410(18): 1666-1683 (2009)</
 p>\n        <p>Part 2 (22 June 13:00-15:00) covers
  combinatorial optimization problems and their lin
 ear programming relaxations and issues of symmetry
  and definability.<br/>\n          Literature: Mat
 thew Anderson, Anuj Dawar, Bjarki Holm, Solving Li
 near Programs without Breaking Abstractions, J. AC
 M 62(6): 48 (2015)</p>\n        <p>Part 3 (23 June
  11:00-14:00) covers the relationship between defi
 nability and circuit complexity for first-order lo
 gic, fixed-point logic and counting logics.<br/>\n
            Literature: Matthew Anderson, Anuj Dawa
 r: On Symmetric Circuits and Fixed-Point Logics. S
 TACS 2014: 41-52</p>\n    \n        For more infor
 mation, please contact <a class="email">bloewe <sp
 an class="at">at</span> science.uva.nl</a>\n    
URL:/NewsandEvents/Archives/2016/newsitem/7319/21-
 23-June-2016-Tutorial-Definability-and-Complexity-
 of-Counting-Logics-
END:VEVENT
END:VCALENDAR