The fourth edition of SAT+SMT Winter School will host a poster session. The poster session aims to give students, researchers and professionals an opportunity to present technical materials to the research community, and to get responses from other researchers in the field. The 2019 SAT+SMT Winter School promises to be an exciting event comprising of prominent speakers from academia and industry from France, Germany, India and United States who have been involved in the development and/or deployment of SAT/SMT solvers in several industry-scale projects worldwide.
Submissions that address topics of wide interest may also be allocated a short talk during the school.
All contributions addressing different aspects of the satisfiability problem interpreted in a broad sense. Domains include MaxSAT, Pseudo-Boolean (PB) constraints, Quantified Boolean Formulae (QBF), Satisfiability Modulo Theories (SMT), as well as Constraint Satisfaction Problems (CSP).
Topics include, but are not restricted to:
Theoretical advances (including algorithms, proof complexity, parameterized complexity, and other complexity issues);
Practical search algorithms;
Model Counting and Uniform Sampling
Implementation-level details of SAT solving tools and SAT-based systems;
Problem encodings and reformulations;
Applications (including both novel applications domains and improvements to existing approaches);
Case studies and reports on insightful findings based on rigorous experimentation.
The submissions should be submitted in the form of a PDF file formatted along the lines of the AAAI formatting instructions available at http://www.aaai.org/Publications/Author/author.php
. The submissions can use a maximum of 2 pages and can cover work in progress material or the material that has already been submitted or published in other journals or conferences.
Deadline for submitting abstracts:
November 5 (midnight, AoE)
Notification: November 10 (midnight, AoE)
Accepted submissions will be sent instructions for poster size after the notification.