February 13, 2005: Electronic registration..
February 20, 2005: Paper Submission.
February 23, 2005: SAT and QBF solver & benchmark Submission.
April 8, 2005: Author Notification.
April 22, 2005, Camera Ready Copy due.
International Conference on
Call for Papers
The International Conference on Theory and Applications of Satisfiability Testing is the primary annual meeting for researchers studying the propositional satisfiability problem (SAT). Located in the historic town of St Andrews, SAT 2005 will feature technical paper and poster sessions, invited talks, and the annual SAT Solver Competition and QBF Solver Evaluation.
We welcome submissions on SAT from any discipline with an interest in the problem, including theoretical, experimental and applied work. Topics of interest include, but are not limited to: Proof Systems and Proof Complexity, Search Algorithms and Heuristics, Analysis of Algorithms, Theories beyond the propositional, Hard Instances, Problem Encodings, Industrial Applications, Solvers and other tools, Case Studies and Empirical results.
Accepted papers will be collected together and distributed at the conference in a LNCS volume. All submissions must be 15 pages or less in the Springer-Verlag LNCS style (http://www.springer.de/comp/lncs/authors.html). All appendices, tables, figures and the bibliography must fit into the 15 page limit. Submissions deviating from this requirement may be rejected without review. Submission will be in electronic form as PDF files, and authors should refer to the conference web site (http://www.satisfiability.org/SAT05) for details. Authors are asked to register their papers on the web site one week before the submission deadline. All submissions will be reviewed by three members of the program committee, and may be accepted for either a paper or poster presentation.
Associated with the conference are the 2005 SAT Solver Competition and the 2005 QBF Solver Evaluation. The SAT competition and QBF evaluation organizers welcome submissions of for both SAT and QBF, benchmark instances, as well as SAT and QBF solvers. For details see the 2005 SAT Solver Competition web page, http://satlive.org/SATCompetition/2005, and the 2005 QBF Solver Evaluation web page http://satlive.org/QBFEvaluation/2005.