posted by user: lpandolfo || 5336 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 22, 2020
Submission Deadline Feb 29, 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

COCOA 2022   16th Annual International Conference on Combinatorial Optimization and Applications
RAMFP 2022   TAA (OA) - SI: Recent Advances on Metric Fixed Point Theory 2022
ADMA 2022   18th International Conference on Advanced Data Mining and Applications
VSTTE 2022   14th International Conference on Verified Software: Theories, Tools, and Experiments
ICONIP 2022   29th International Conference on Neural Information Processing-2022
MDA AI&PR 2023   18th International Conference on Mass Data Analysis of Images and Signals with Applications in Medicine, r/g/b Biotechnology, Food Industries and Dietetics, Biometry and Security,
SMT 2022   20th International Workshop on Satisfiability Modulo Theories
IJGTT 2022   International Journal of Game Theory and Technology
ACM SaT-CPS 2022   ACM Workshop on Secure and Trustworthy Cyber-Physical Systems
EvoCompAISecurity&Privacy 2022   Evolutionary Computing for AI-Driven Security and Privacy: Advancing the state-of-the-art applications