SAT'10 - The International Conferences on Theory and Applications of Satisfiability Testing (SAT)
Edinburgh, UK, July 11-14, 2010
- Abstract Submission: February 1, 2010
- Paper Submission: February 8, 2010
- Author Notification: March 15, 2010
- Final Version: April 5, 2010
Scope and Mission
The International Conference on Theory and Applications of Satisfiability Testing SAT is the primary annual meeting for researchers studying the propositional satisfiability problem. SAT 2010 is the thirteenth SAT conference. SAT 2010 features the SAT Race, the Pseudo-Boolean evaluation, and the MAX-SAT evaluation.
Many hard combinatorial problems can be encoded into SAT. Therefore improvements on heuristics on the practical side, as well as theoretical insights into SAT, apply to a large range of real-world problems. More specifically, many important practical verification problems can be rephrased as SAT problems. This applies to verification problems in hardware and software. Thus SAT is becoming one of the most important core technologies to verify secure and dependable systems. The topics of the conference span practical and theoretical research on SAT and its applications, and include, but are not limited to:
- Proof Systems and Proof Complexity
- Search Algorithms and Heuristics
- Analysis of Algorithms
- Combinatorial Theory of Satisfiability
- Random Instances vs Structured Instances
- Problem Encodings
- Industrial Applications
- Applications to Combinatorics
- Solvers, Simplifiers and Tools
- Case Studies and Empirical Results
- Exact and Parameterized Algorithms
SAT is interpreted in a rather broad sense: besides propositional satisfiability, it includes the domain of quantified boolean formulae (QBF), constraints programming techniques (CSP) for word-level problems and their propositional encoding and particularly satisfiability modulo theories (SMT).
Paper submissions should contain original material and can either be regular research papers up to 14 pages or short papers up to 6 pages. Submitted papers may include a technical appendix in addition to the page restriction; however, the paper must be intelligible without the appendix and PC members are not required to read the appendix. Regular papers may be accepted as short papers, by decision of the program committee. Double submissions including submissions as short and long papers will be rejected. Submissions should use the Springer LNCS style (see here). All tables, figures and the bibliography must fit into the page limit. Appendices that the author considers as part of the final submission should fit in the page limit as well. Submissions deviating from these requirements may be rejected without review. All accepted papers including short papers will be included in the proceedings of the conference, which will be published in Springer's LNCS series. The submission page is hosted by Easychair. Papers have to be submitted electronically as PDF files.
Information about SAT affiliated events, including workshops and competitions can be found through the conference's web site. SAT 2010 is one of eight conferences in the Federated Logic Conference FLoC 2010.