[FOM] SAT 2014: Last Call for Papers

Carsten Sinz carsten.sinz at kit.edu
Mon Jan 20 18:28:43 EST 2014


                      LAST CALL FOR PAPERS

               Seventeenth International Conference on 
                          --- SAT 2014 ---

                Vienna, Austria, July 14-17, 2014

          Abstract submission deadline: January 24, 2014
             Paper submission deadline: January 31, 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.


(Follow http://baldur.iti.kit.edu/sat2014 for updates.)

January 24, 2014: Abstract submission deadline (firm)
January 31, 2014: Paper submission deadline (firm)
March   17, 2014 (approx.): Response from authors begins, lasts 72 hours
March   27, 2014: Acceptance notifications
April   17, 2014: Final camera-ready versions

July 12/13, 2014: Pre-conference workshops
July 14-17, 2014: Main conference 
July 17/18, 2014: Post-conference workshops


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 
  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


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 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 


All accepted papers will be published in the proceedings of the 
conference, which will be published within the Springer LNCS series.


Invited talks will be given by
*  Leonardo de Moura, Microsoft Research
*  Jakob Nordström, KTH Stockholm

Moreover, there will be joint FLoC/VSL invited talks by:
*  Christos Papadimitriou, University of California, Berkeley
*  Dana Scott, Carnegie Mellon University
*  Alex Wilkie, University of Manchester


Affiliated with SAT 2014 will be fourteen workshops and five
competitions. For a list and detailed information about these events see
the SAT 2014 web page.


Uwe Egly             Vienna University of Technology, Austria
Carsten Sinz         Karlsruhe Institute of Technology, Germany


Ines Lynce           Technical University of Lisbon, Portugal


Laurent Simon        University of Bordeaux, France


Gilles Audemard      Artois University, France
Fahiem Bacchus       University of Toronto, Canada
Anton Belov          University College Dublin, Ireland
Olaf Beyersdorff     University of Leeds, UK
Armin Biere          Johannes Kepler University Linz, Austria
Alessandro Cimatti   Fondazione Bruno Kessler, Italy
Nadia Creignou       University of Aix-Marseille, France
John Franco          University of Cincinnati, USA
Enrico Giunchiglia   University of Genoa, Italy
Youssef Hamadi       Microsoft Research Cambridge, UK
Marijn Heule         University of Texas at Austin, USA
Holger H. Hoos       University of British Columbia, Canada
Matti Järvisalo      University of Helsinki, Finland
Hans Kleine Büning   University of Paderborn, Germany
Oliver Kullmann      Swansea University, UK
Daniel Le Berre      Artois University, France
Chu Min Li           University of Picardie Jules Verne, France
Florian Lonsing      Vienna University of Technology, Austria
Ines Lynce           Technical University of Lisbon, Portugal
Panagiotis Manolios  Northeastern University, USA
Norbert Manthey      TU Dresden, Germany
Joao Marques-Silva   University College Dublin, Ireland
Alexander Nadel      Intel Haifa, Israel
Jakob Nordström      KTH Royal Institute of Technology, Sweden
Albert Oliveras      Technical University of Catalonia, Spain
Jussi Rintanen       Aalto University, Finland
Lakhdar Sais         Artois University, France
Karem Sakallah       University of Michigan, USA
Horst Samulowitz     IBM TJ Watson Research Center, USA
Tobias Schubert      Albert-Ludwigs-University of Freiburg, Germany
Roberto Sebastiani   University of Trento, Italy
Martina Seidl        Johannes Kepler University Linz, Austria
Bart Selman          Cornell University, USA
Stefan Szeider       Vienna University of Technology, Austria
Jacobo Torán         University of Ulm, Germany
Allen Van Gelder     University of California at Santa Cruz, USA
Xishun Zhao          Sun Yat-sen University, China

-------------- next part --------------
An HTML attachment was scrubbed...
URL: </pipermail/fom/attachments/20140121/09d45c83/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: </pipermail/fom/attachments/20140121/09d45c83/attachment-0001.p7s>

More information about the FOM mailing list