Our sponsors


June 29, 2011 Old pages moved, Photos added

June 13, 2011 Additional directions to housing added

June 2, 2011 lodging at Baits is full

May 3, 2011 Conference Schedule added

Apr 15, 2011 Final list of accepted papers added

Apr 4, 2011 Accommodation / Registration Opened

Feb 17,2011: MaxSAT Evaluation Deadline Added

Feb 16, 2011: Extended Deadline for paper submissions (21st instead of 18th, Feb).

Dec 20, 2010: Final CFP Added

Sep 24, 2010: Preliminary CFP Added

Aug 31, 2010: Web Site opens


Workshops proposals
Dec. 17, 2010

Abstract submission
Feb. 11, 2011

Paper submission
Feb. 21, 2011

Author notification
Mar. 20, 2011

Final version
Apr. 8, 2011

June 19th to 22th, 2011

June 18th and 23th, 2011

Affiliated Events Main Dates

SAT Competition
Web site
Bench. Submission:
Feb. 13, 2011
Solver Submission:
(ext.) March 2, 2011

PB Evaluation
Web Site
Solver/Benchs. Subm.:
March 20, 2011

MAX-SAT Evaluation
Web Site
Solver Submission:
March 25, 2011

Affiliated Workshops Main Dates

web site
Abstract: April, 10th
Papers: April, 17th

web site
Abstract: April, 22nd
Papers: April, 29th

web site
Abstract: April, 17th
Papers: April, 24th

SAT/SMT Solver Summer School 2011

The SAT 2011 conference is held just a few days after the SAT/SMT Solver Summer School 2011 (from June 12th to June 17th), located at MIT, Cambridge, USA.

SAT 2011 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 2011 is the fourteenth SAT conference and features the SAT competition, the Pseudo-Boolean evaluation, and the MAX-SAT evaluation.

Many hard combinatorial problems can be encoded as SAT instances, including problems that arise in hardware and software verification, AI planning and scheduling, OR resource allocation, etc. The theoretical and practical advances in SAT research over the past dozen years have contributed to making SAT technology an indispensable tool in many of these domains. The SAT conference aims to further advance the field by soliciting original theoretical and practical contributions on a wide range of topics including, but are not limited to proof systems, proof complexity, search algorithms, heuristics, analysis of algorithms, hard instances, randomized formulae, problem encodings, industrial applications, solvers, simplifiers, tools, case studies and empirical results. 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).

Submissions should contain original material up to 14 pages and use the Springer LNCS style. All appendices, tables, figures and the bibliography must fit into the 14-page limit. Submissions deviating from these requirements may be rejected without review. Please note that there is no distinction between short and long papers; submissions will be judged based on their quality not their length. Some novel ideas can be adequately presented in 6 pages; others may require 12 pages. All accepted papers will be published in the proceedings of the conference. The conference proceedings will be published within the Springer LNCS series.

The paper submission page is

LNCS style authors instructions is

Important Dates

December 17, 2010: Workshop Proposals
February 11, 2011: Abstract Submission
February 21, 2011: Paper Submission (extended deadline)
March 18, 2011: Author Notification
April 1, 2011: Final Version

Call for Workshops Proposals

Researchers and practitioners are invited to submit proposals for associated workshops on related topics. Workshops will have to be financially self-supporting. Proposals should consist of two parts. First, a short scientific justification of the proposed topic, its significance, and the particular benefits of the workshop to the community, as well as a list of previous or related workshops (if relevant). A second, organizational part should include contact information of the workshop organizers, procedures for selecting papers and participants, estimate of the audience size and a tentative list of the program committee. Proposals are due by December 17, 2010 and must be submitted electronically as a PDF files, by email, to both SAT Conference Chairs: and

Conference Chairs

Karem A. Sakallah, University of Michigan, USA
Laurent Simon, University of Paris-Sud 11, France

Associated Competitive Events

SAT Competition 2011
web site:

MAX-SAT Evaluation 2011
web site:

PB Evaluation 2011
web site:

You can find this CFP as a poster


Karem A. Sakallah, University of Michigan, USA
Laurent Simon, University of Paris-Sud 11, France

Program Committee

Paul Beame, University of Washington, USA
Armin Biere, Johannes Kepler University, Austria
Randal Bryant, Carnegie Mellon University, USA
Alessandro Cimatti, Istituto per la Ricerca Scientifica e Tecnologica, Italy
Nadia Creignou, Université de la Méditerranée, France
Leonardo de Moura, Microsoft Research, USA
John Franco, University of Cincinnati, USA
Enrico Giunchiglia, Università di Genova, Italy
Youssef Hamadi, Microsoft Research, UK
Marijn Heule, Delft University of Technology, The Netherlands
Holger Hoos, University of British Columbia, Canada
Katsumi Inoue, National Institute of Informatics, Japan
George Katsirelos, University of Paris-Sud 11, France
Hans Kleine Büning, University of Paderborn, Germany
Oliver Kullmann, University of Wales Swansea, UK
Daniel Le Berre, Université d’Artois, France
Chu-Min LI, University of Picardie Jules Verne, France
Mark Liffiton, Illinois Wesleyan University, USA
Inês Lynce, Instituto Superior Técnico, Portugal
Panagiotis Manolios, Northeastern University, USA
Vasco Manquinho, Instituto Superior Técnico, Portugal
Felip Manyà, Spanish Council for Scientific Research, Spain
Igor Markov, University of Michigan, USA
Joao Marques-Silva, University College Dublin, Ireland
Cristopher Moore, University of New Mexico, USA
Albert Oliveras, Technical University of Catalonia, Spain
Ramamohan Paturi, University of California, San Diego, USA
Steve Prestwich, University College Cork, Ireland
Lakhdar Saïs, Université d’Artois, France
Roberto Sebastiani, Universita di Trento, Italy
Carsten Sinz, Karlsruhe Institute of Technology, Germany
Stefan Szeider, Vienna University of Technology, Austria
Armando Tacchella, Università di Genova, Italy
Allen Van Gelder, University of California, Santa Cruz, USA
Hans van Maaren, Delft University of Technology, The Netherlands
Toby Walsh, University of New South Wales, Australia
Xishun Zhao, Sun Yat-Sen University, China