Scope
SAT 2015 welcomes scientific contributions addressing different aspects of the satisfiability problem, interpreted in a broad sense. Domains include MaxSAT and Pseudo-Boolean (PB) constraints, Quantified Boolean Formulae (QBF), Satisfiability Modulo Theories (SMT), as well as Constraint Satisfaction Problems (CSP). Topics include (but are not restricted to):

Theoretical advances (including exact algorithms, proof complexity, and other complexity issues)
Practical search algorithms
Knowledge compilation
Implementation-level details of SAT solving tools and SAT-based systems
Problem encodings and reformulations
Applications (including both novel applications domains and improvements to existing approaches)
Case studies and reports on insightful findings based on rigorous experimentation

Out of Scope
Papers claiming to resolve a major long-standing open theoretical question in Mathematics or Computer Science (such as those for which a Millennium Prize is offered), are outside the scope of the conference because of insufficient time in the schedule to referee such papers; instead, such papers should be submitted to an appropriate technical journal.

Paper Categories
Submissions to SAT 2015 are solicited in three paper categories, describing original contributions:

REGULAR PAPERS (9 to 15 pages, excluding references)
Regular papers should contain original research, with sufficient detail to assess the merits and relevance of the contribution. For papers reporting experimental results, authors are strongly encouraged to make their data and implementations available with their submission. Submissions reporting on case studies are also encouraged, and should describe details, weaknesses, and strengths in sufficient depth.

SHORT PAPERS (up to 8 pages, excluding references)
The same evaluation criteria apply to short papers as to regular papers. They will be reviewed to the same standards of quality as regular papers, but will naturally contain less quantity of new material. Short papers will have the same status as regular papers and be eligible for the same awards (to be announced later).

TOOL PAPERS (up to 6 pages, excluding references)
A tool paper should describe the implemented tool and its novel features. Here "tools" are interpreted in a broad sense, including descriptions of implemented solvers, preprocessors, etc., as well as systems that utilize SAT solvers or their extensions to solve interesting problem domains. A demonstration is expected to accompany a tool presentation. Papers describing tools that have already been presented previously are expected to contain significant and clear enhancements to the tool.

For all paper categories, the page limits stated above do not include references, but do include all other material intended to appear in the conference proceedings. Submissions should use the Springer LNCS style (without space-squeezing modifications), and be written in English.

Regular papers and short papers may be considered for a best paper award. If the main author is a student, both in terms of work and writing, the paper may be considered for a best student-paper award. Use the supplement to the submission to state (in a brief cover letter) if the paper qualifies as a student paper.

Besides the paper itself, authors may submit a supplement consisting of one file in the format of a gzipped tarball (.tar.gz or .tgz) or a gzipped file (.gz) or a zip archive (.zip). Authors are encouraged to submit a supplement when it will help reviewers evaluate the paper. Supplements will be treated with the same degree of confidentiality as the paper itself. For example, the supplement might contain detailed proofs, examples, software, detailed experimental data, or other material related to the submission. Individual reviewers may or may not consult the supplementary material; the paper itself should be self-contained.


Proceedings
All accepted papers will be published in the proceedings of the conference, which will be published within the Springer Lecture Notes in Computer Science series.