[Om-announce] SAT 2014: First Call for Papers
Carsten Sinz
carsten.sinz at kit.edu
Mon Nov 18 00:14:41 CET 2013
------------------------------------------------------------------------
CALL FOR PAPERS
Seventeenth International Conference on
THEORY AND APPLICATIONS OF SATISFIABILITY TESTING
--- SAT 2014 ---
Vienna, Austria, July 14-17, 2014
http://baldur.iti.kit.edu/sat2014
Abstract submission deadline: January 17, 2014
Paper submission deadline: January 24, 2014
------------------------------------------------------------------------
The International Conference on Theory and Applications of
Satisfiability Testing (SAT) is the primary annual meeting for
researchers studying the theory and applications of the propositional
satisfiability problem.
It includes, besides plain propositional satisfiability, 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 encoded as SAT instances, in the
broad sense mentioned above, including problems in formal verification
(hardware and software), artificial intelligence, and operations
research. More recently, biology, cryptology, data mining, machine
learning, and mathematics have been added to the growing list.
The SAT conference aims to further advance the field by soliciting
original theoretical and practical contributions in these areas with a
clear connection to satisfiability.
SAT 2014 takes place in Vienna, Austria, and will be part of the
Vienna Summer of Logic. With over two thousand expected participants,
the Vienna Summer of Logic 2014 will be the largest event in the
history of logic, and will consist of twelve large conferences and
numerous workshops, attracting researchers from all over the world.
Vienna, the capital of Austria, is well known for its historic role in
music (Mozart, van Beethoven, Liszt, and Brahms, among others, came
there to work), its churches (e.g., St. Stephen's Cathedral), museums
and architecture. Moreover, Vienna was ranked the world's most livable
city in 2005.
IMPORTANT DATES
===============
(Follow http://baldur.iti.kit.edu/sat2014 for updates.)
January 17, 2014: Abstract submission deadline
January 24, 2014: Paper submission deadline
March 17, 2014 (approx.): Response from authors begins, lasts 72 hours
March 27, 2014: Acceptance notifications
April 17, 2014: Final camera-ready versions
July 14-17, 2014: Main conference and workshops
SCOPE
=====
SAT 2014 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), 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, see http://www.claymath.org/millennium)
are outside the scope of the conference because there is insufficient
time in the schedule to referee such papers; instead, such papers
should be submitted to an appropriate technical journal.
SUBMISSIONS
===========
Submissions to SAT 2014 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 exploit 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.
Submissions should not be under review elsewhere nor be submitted
elsewhere while under review for SAT 2014, and should not consist of
previously published material.
Submissions not consistent with the above guidelines may be returned
without review.
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 such a supplement when it will help reviewers to evaluate
the paper, and such a supplement 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 should be self-contained.
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 your submission to state (in a brief cover letter)
if the paper qualifies as a student paper.
Links to information on the Springer LNCS style is available through
the SAT website at http://baldur.iti.kit.edu/sat2014/cfp.html .
All papers submissions are done exclusively via EasyChair at
http://www.easychair.org/conferences/?conf=sat2014 .
One author of each accepted paper is expected to present it at the
conference.
PROCEEDINGS
===========
All accepted papers will be published in the proceedings of the
conference, which will be published within the Springer LNCS series.
WORKSHOPS AND COMPETITONS
=========================
Affiliated with SAT 2014 are several workshops and competitions.
For a list and detailed information about these events see the SAT 2014
web page.
PROGRAM CHAIRS
==============
Uwe Egly Vienna University of Technology, Austria
Carsten Sinz Karlsruhe Institute of Technology, Germany
WORKSHOPS CHAIR
===============
Ines Lynce Technical University of Lisbon, Portugal
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://openmath.org/pipermail/om-announce/attachments/20131118/7461642e/attachment-0001.html>
-------------- next part --------------
A non-text attachment was scrubbed...
Name: smime.p7s
Type: application/pkcs7-signature
Size: 4929 bytes
Desc: not available
URL: <http://openmath.org/pipermail/om-announce/attachments/20131118/7461642e/attachment-0001.bin>
More information about the Om-announce
mailing list