[Proof Complexity] International SAT/SMT/AR Summer School

Jakob Nordström jakobn at kth.se
Mon May 2 12:43:45 CEST 2016

Dear colleagues,

Please find below a call for participation for the International SAT/SMT/AR Summer School, to be held in Lisbon in June.

For those students who are curious about all the amazing things practitioners are able to with the SAT problems and its friends, this should be an excellent opportunity to get an overview.

Best regards,

Jakob Nordström


     International SAT/SMT/AR Summer School
     Instituto Superior Técnico (IST/UL), University of Lisbon
     Lisbon, Portugal, June 22-25, 2016


Full details of the application and registration procedure are
available at the school website (http://ssa-school-2016.it.uu.se/).


Satisfiability (SAT), Satisfiability Modulo Theories (SMT), and
Automated Reasoning (AR) continue to make rapid advances and find
novel uses in a wide variety of applications, both in computer science
and beyond.  The SAT/SMT/AR Summer School aims to bring a select group
of students up to speed quickly in this exciting research area. The
lectures cover both foundational and practical aspects of SAT, SMT,
and AR technologies, and their application.

The school is the first SAT/SMT/AR Summer School, but continues the
successful line of SAT/SMT Summer Schools, which have taken place
annually since 2011. The SAT/SMT/AR Summer School will take place on
June 22-25 2016 in Lisbon, Portugal, in the week before the IJCAR
conference in Coimbra (27 June - 2 July), which in turn is followed by
the SAT conference in Bordeaux (July 5-8). The school takes place at
the Instituto Superior Técnico (IST/UL), University of Lisbon.


* Maria Paola Bonacina (Università degli Studi di Verona, Italy)
* Supratik Chakraborty (IIT Bombay, India)
* Dejan Jovanovic (SRI International, USA)
* Matti Järvisalo (University of Helsinki, Finland)
* Marius Lindauer (University of Freiburg, Germany)
* Florian Lonsing (TU Vienna, Austria)
* Nuno P. Lopes (Microsoft Research Cambridge, UK)
* Jakob Nordström (KTH Royal Institute of Technology, Sweden)
* Andrew Reynolds (University of Iowa, USA)
* João Marques Silva (University of Lisbon, Portugal)
* Laurent Simon (Bordeaux INP, University of Bordeaux, LaBRI-CNRS, France)
* Christoph Weidenbach (Max-Planck-Institut für Informatik, Germany)
* Thomas Wies (New York University, USA)

More details about the programme are available on the school webpage

Organizing committee:

Inês Lynce, University of Lisbon
Ruzica Piskac, Yale University
Philipp Rümmer, Uppsala University

More information about the Proof-Complexity mailing list