Site Overlay

Workshops

We are continuously monitoring the COVID-19 situation from local authorities and the World Health Organization. Considering that measures that are been taken around the world will take at least a month to show results, we are planning to wait until the middle/end of April to identify alternative solutions (e.g., remote presentation, postponement of the conference).

 
The list of workshops co-located with the SAT conference are as follows (under updating):

See the Call for Workshop Proposal here

Pragmatics of SAT (POS)

The aim of the pragmatics of SAT workshop is to allow researchers concerned with the design of efficient SAT solvers at large or SAT encodings to meet and discuss about their latest results. The workshop is also the place for users of SAT technology to present their applications.

For further information, please visit the Pragmatics of SAT workshop website: http://www.pragmaticsofsat.org/
Workshop Date: July 5th 2020

QBF Workshop

The goal of the International Workshop on Quantified Boolean Formulas (QBF Workshop) is to bring together researchers working on theoretical and practical aspects of QBF solving. In addition to that, it addresses (potential) users of QBF in order to reflect on the state-of-the-art and to consolidate on immediate and long-term research challenges. In particular, the following topics shall be considered at the workshop: 1) Directions of Solver Development; 2) Certificates; 3) Applications; 4) Community platform and repository.

For further information, please visit the QBF workshop website: https://www.ac.tuwien.ac.at/qbf2020/index.html
Workshop Date: July 5th 2020
Organizers:

Model Counting

The International Workshop on Model Counting (MCW 2020) aims to provide a venue for researchers working on model counting such as model counting (mc), weighted model counting/sum-of-products (wmc), projected model counting (pmc), weighted model integration (wmi) within the realm but not restricting to Boolean satisfiability (SAT), satisfiability modulo theories (SMT), Answer set programming (ASP), constraint programming (CP), or logic programming. It encourages to meet, communicate, and discuss the latest theoretical and practical results. In particular we aim for novel theoretical insights and solving techniques such as approximate counting, CDCL-based approaches, Monte Carlo, knowledge compilation, or probabilistic exact counting. We encourage the submission on descriptions of novel solvers or alternative use of recent parallel hardware, related solver technologies, and applications of model counting. The workshop is also the place for developers of model counters to present their solvers and the presentation of detailed results on the model counting competition.

For further information, please visit the Model Counting workshop website: http://modelcounting.org
Workshop Date: July 5th 2020

 

Contact Information
SAT 2020 Workshop Chair
Florian Lonsing
Stanford University
http://www.florianlonsing.com/
e-mail: lonsing AT-SIGN cs.stanford.edu