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/2014/newsitem/5643/12-
 13-July-2014-FLoC-workshop-on-proof-complexity-Vie
 nna-Austria
DTSTAMP:20140501T000000
SUMMARY:FLoC workshop on proof complexity, Vienna,
  Austria
DTSTART;VALUE=DATE:20140712
DTEND;VALUE=DATE:20140516
LOCATION:Vienna, Austria
DESCRIPTION:Proof complexity is the study of the c
 omplexity of theorem proving procedures. The centr
 al question in proof complexity is: given a theore
 m F and a proof system P, what is the size of the 
 smallest proof of F in the system P? Moreover, how
  difficult is it to construct a small proof? Many 
 ingenious techniques have been developed to try to
  answer these questions; and they bare tight relat
 ions to intricate theoretical questions from compu
 tational complexity (such as the celebrated P vs. 
 NP problem), mathematical logic (e.g. separating t
 heories of Bounded Arithmetic) as well as to pract
 ical problems in SAT solving.   The workshop will 
 be part of the Vienna Summer of Logic and will be 
 affiliated with the conferences SAT'14 and CSL/LIC
 S'14.   For more information, see http://vsl2014.a
 t/pages/PC-index.html   We welcome 1-2-page abstra
 cts presenting (finished, ongoing, or if clearly s
 tated even recently published) work on proof compl
 exity. Submission deadline is 16 May 2014.
X-ALT-DESC;FMTTYPE=text/html:<div>\n      <p>\n   
      Proof complexity is the study of the complexi
 ty of theorem\n        proving procedures. The cen
 tral question in proof complexity\n        is: giv
 en a theorem F and a proof system P, what is the s
 ize\n        of the smallest proof of F in the sys
 tem P?  Moreover, how\n        difficult is it to 
 construct a small proof?\n        Many ingenious t
 echniques have been developed to try to answer\n  
       these questions; and they bare tight relatio
 ns to intricate\n        theoretical questions fro
 m computational complexity (such as\n        the c
 elebrated P vs. NP problem), mathematical logic\n 
        (e.g. separating theories of Bounded Arithm
 etic) as well as to\n        practical problems in
  SAT solving.\n      </p>\n      <p>The workshop w
 ill be part of the Vienna Summer of Logic and will
  be \n        affiliated with the conferences SAT'
 14 and CSL/LICS'14.\n      </p>\n    \n      \n   
    <p>For more information, see\n        <a target
 ="_blank" href="http://vsl2014.at/pages/PC-index.h
 tml">http://vsl2014.at/pages/PC-index.html</a>\n  
     </p>\n    </div><div>\n      <p>\n        We w
 elcome 1-2-page abstracts presenting (finished, on
 going, or if clearly stated even recently publishe
 d) work on proof complexity.\n        Submission d
 eadline is 16 May 2014.\n      </p>\n      </div>
URL:/NewsandEvents/Archives/2014/newsitem/5643/12-
 13-July-2014-FLoC-workshop-on-proof-complexity-Vie
 nna-Austria
END:VEVENT
END:VCALENDAR