posted by user: lpandolfo || 5061 views || tracked by 11 users: [display]

SAT 2020 : Theory and Applications of Satisfiability Testing

FacebookTwitterLinkedInGoogle


Conference Series : Theory and Applications of Satisfiability Testing
 
Link: http://sat2020.idea-researchlab.org/
 
When Jul 5, 2020 - Jul 9, 2020
Where Alghero, Italy
Abstract Registration Due Feb 15, 2020
Submission Deadline Feb 22, 2020
Notification Due Apr 18, 2020
Final Version Due May 3, 2020
Categories    satisfiability testing
 

Call For Papers

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

DeLTA 2022   3rd International Conference on Deep Learning Theory and Applications
Bioinspired Intelligent Algorithms 2021   Special Issue Bioinspired Intelligent Algorithms for Optimization, Modeling and Control: Theory and Applications
CCTA 2022   6th IEEE Conference on Control Technology and Applications
FSDM 2022   Fuzzy sets in decision making - Topological Algebra and its Applications (OA)
SMT 2021   SMT 2021 -- 19th International Workshop on Satisfiability Modulo Theories
ICST 2022   15th IEEE International Conference on Software Testing, Verification and Validation (ICST) 2022
EvoCompAISecurity&Privacy 2022   Evolutionary Computing for AI-Driven Security and Privacy: Advancing the state-of-the-art applications
JMC 2022   JOURNAL OF MATHEMATICAL CRYPTOLOGY
ISSTA 2022   International Symposium on Software Testing and Analysis
VISAPP 2022   17th International Conference on Computer Vision Theory and Applications