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/7350/4-J
 uly-2016-4th-International-Workshop-on-Quantified-
 Boolean-Formulas-and-Beyond-QBF-2016-Bordeaux-Fran
 ce
DTSTAMP:20160430T000000
SUMMARY:4th International Workshop on Quantified B
 oolean Formulas (and Beyond) (QBF 2016), Bordeaux,
  France
DTSTART;VALUE=DATE:20160704
DTEND;VALUE=DATE:20160704
LOCATION:Bordeaux, France
DESCRIPTION:Quantified Boolean formulas (QBF) are 
 an extension of propositional logic which allows f
 or explicit quantification over propositional vari
 ables. The decision problem of QBF is PSPACE-compl
 ete compared to NP-completeness of the decision pr
 oblem of propositional logic (SAT). Many problems 
 from application domains such as model checking, f
 ormal verification or synthesis are PSPACE-complet
 e, and hence could be encoded in QBF. Considerable
  progress has been made in the theory and practice
  of QBF solving throughout the past years.   The g
 oal of the International Workshop on Quantified Bo
 olean Formulas (and Beyond) is to bring together r
 esearchers working on theoretical and practical as
 pects of QBF solving and related formalisms involv
 ing quantifiers. The workshop addresses theoretici
 ans and practitioners in order to reflect on the s
 tate of the art in research and to consolidate on 
 immediate and long-term challenges. As the efforts
  of extending languages with quantifiers have not 
 only been made for propositional logic in terms of
  QBFs, but in many other formalism like Constraint
  Satisfaction Problem (CSP) and Satisfiability Mod
 ulo Theories (SMT), QBF 2016 also targets research
 ers working in these related fields in order to ex
 change experiences and ideas.   For more informati
 on, see http://fmv.jku.at/qbf16/  We solicit paper
  submissions in the following categories: talk-onl
 y papers (presenting work that has been published 
 already, novel unpublished work, or work in progre
 ss), full papers (describing novel, unpublished wo
 rk, including work in progress) and short tutorial
  presentations (on topics related to the workshop)
 . Deadline for submissions: 8 May 2016.
X-ALT-DESC;FMTTYPE=text/html:<div>\n      <p>Quant
 ified Boolean formulas (QBF) are an extension of p
 ropositional\n        logic which allows for expli
 cit quantification over propositional\n        var
 iables. The decision problem of QBF is PSPACE-comp
 lete compared to\n        NP-completeness of the d
 ecision problem of propositional logic (SAT).\n   
      Many problems from application domains such a
 s model checking, formal\n        verification or 
 synthesis are PSPACE-complete, and hence could be\
 n        encoded in QBF. Considerable progress has
  been made in the theory and\n        practice of 
 QBF solving throughout the past years.\n      </p>
 \n      <p>The goal of the International Workshop 
 on Quantified Boolean Formulas\n        (and Beyon
 d) is to bring together researchers working on the
 oretical\n        and practical aspects of QBF sol
 ving and related formalisms involving\n        qua
 ntifiers. The workshop addresses theoreticians and
  practitioners in\n        order to reflect on the
  state of the art in research and to\n        cons
 olidate on immediate and long-term challenges. As 
 the efforts of extending languages with quantifier
 s have not only\n        been made for proposition
 al logic in terms of QBFs, but in many other\n    
     formalism like Constraint Satisfaction Problem
  (CSP) and\n        Satisfiability Modulo Theories
  (SMT), QBF 2016 also targets\n        researchers
  working in these related fields in order to excha
 nge\n        experiences and ideas.\n      </p>\n 
    \n      \n      <p>For more information, see\n 
        <a target="_blank" href="http://fmv.jku.at/
 qbf16/">http://fmv.jku.at/qbf16/</a>\n      </p>\n
     </div><div>\n      <p>We solicit paper submiss
 ions in the following categories:\n      talk-only
  papers (presenting work that has been published\n
       already, novel unpublished work, or work in 
 progress), full\n      papers (describing novel, u
 npublished work, including work in\n      progress
 ) and short tutorial presentations (on topics rela
 ted to\n      the workshop). Deadline for submissi
 ons: 8 May 2016.\n      </p>\n      </div>
URL:/NewsandEvents/Archives/2016/newsitem/7350/4-J
 uly-2016-4th-International-Workshop-on-Quantified-
 Boolean-Formulas-and-Beyond-QBF-2016-Bordeaux-Fran
 ce
END:VEVENT
END:VCALENDAR