SAT: Theory and Applications of Satisfiability Testing

FacebookTwitterLinkedInGoogle

 

Past:   Proceedings on DBLP

Future:  Post a CFP for 2021 or later   |   Invite the Organizers Email

 
 

All CFPs on WikiCFP

Event When Where Deadline
SAT 2020 Theory and Applications of Satisfiability Testing
Jul 5, 2020 - Jul 9, 2020 Alghero, Italy Feb 22, 2020 (Feb 15, 2020)
SAT 2018 Theory and Applications of Satisfiability Testing
Jul 9, 2018 - Jul 12, 2018 Oxford, UK Feb 7, 2018 (Jan 31, 2018)
SAT 2017 20th International Conference on Theory and Applications of Satisfiability Testing
Aug 28, 2017 - Sep 1, 2017 Melbourne, Australia May 2, 2017 (Apr 26, 2017)
SAT 2016 International Conference on Theory and Applications of Satisfiability Testing
Jul 5, 2016 - Jul 8, 2016 Bordeaux, France Feb 21, 2016 (Feb 14, 2016)
SAT 2015 18th International Conference on Theory and Applications of Satisfiability Testing
Sep 24, 2015 - Sep 27, 2015 Austin, Texas, USA Apr 29, 2015 (Apr 22, 2015)
SAT 2013 International Conference on Theory and Applications of Satisfiability Testing
Jul 8, 2013 - Jul 12, 2013 Helsinki, Finland Feb 8, 2013 (Feb 1, 2013)
SAT 2008 Conference on Theory and Applications of Satisfiability Testing
May 12, 2008 - May 15, 2008 Guangzhou, P. R. China Jan 11, 2008
 
 

Present CFP : 2020

SAT 2020
The 23rd International Conference on Theory and Applications of Satisfiability Testing
July 6-9 2020, Alghero (Italy)

The International Conference on Theory and Applications of Satisfiability Testing (SAT) is the premier annual meeting for researchers focusing on the theory and applications of the propositional satisfiability problem, broadly construed. In addition to plain propositional satisfiability, it also includes Boolean optimization (such as MaxSAT and Pseudo-Boolean (PB) constraints), Quantified Boolean Formulas (QBF), Satisfiability Modulo Theories (SMT), and Constraint Programming (CP) for problems with clear connections to Boolean-level reasoning.

Many hard combinatorial problems can be tackled using SAT-based techniques including problems that arise in Formal Verification, Artificial Intelligence, operations Research, Computational Biology, Cryptography, Data Mining, Machine Learning, Mathematics, etc. Indeed, the theoretical and practical advances in SAT research over the past twenty years have contributed to making SAT technology an indispensable tool in a variety of domains.

SAT 2020 aims to further advance the field by soliciting original theoretical and practical contributions in these areas with a clear connection to satisfiability. Specifically, SAT 2020 invites scientific contributions addressing different aspects of SAT interpreted in a broad sense, including (but not restricted to) theoretical advances (such as exact algorithms, proof complexity, and other complexity issues), practical search algorithms, knowledge compilation, implementation-level details of SAT solvers and SAT-based systems, problem encodings and reformulations, applications (including both novel application domains and improvements to existing approaches), as well as case studies and reports on findings based on rigorous experimentation.
 

Related Resources

LOPAL 2020   Second International Conference on Learning and Optimization Algorithms: Theory and Applications
GISTAM 2020   6th International Conference on Geographical Information Systems Theory, Applications and Management
Call for a CRC Press book chapter 2020   Big Data Analytics in Supply Chain Management: Theory and Applications
ICST 2020   13th IEEE Conference on Software Testing, Validation and Verification
TMPA 2019   Software Testing, Machine Learning and Complex Process Analysis
ICPP 2020   International Conference on Parallel Processing
VISAPP 2020   15th International Conference on Computer Vision Theory and Applications
STOC 2020   Symposium on the Theory of Computing
VISIGRAPP 2020   15th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications
ISSTA 2020   International Symposium on Software Testing and Analysis