Overview

The International Conference on Theory and Applications of Satisfiability Testing is the primary annual meeting for researchers studying the propositional satisfiability problem (SAT).

Program

• SAT program
• SAT accepted papers
• SAT Associated Workshops and Events

Invited Talks

• Sunday, August 13th, 09:00‑10:00
  Karem Sakallah (University of Michigan, Ann Arbor)
  From Propositional Satisfiability To Satisfiability Modulo Theories [ppt]
• Monday, August 14th, 09:00‑10:00
  Fahiem Bacchus (University of Toronto, Canada)
  CSPs: Adding Structure to SAT [ppt]

Scope

Many hard combinatorial problems can be encoded into SAT. Therefore any improvement on heuristics on the practical side, as wells as theoretical insight into SAT apply to a large range of real-world problems. More specifically, many important practical verification problems can be rephrased as SAT problems. This applies to verification problems in hardware and software. Thus SAT is becoming one of the most important core technologies to verify secure and dependable systems.

The topics of the conference span practical and theoretical research on SAT and its applications and include but are not limited to

• Proof Systems and Proof Complexity
• Search Algorithms and Heuristics
• Analysis of Algorithms
• Hard Instances
• Randomized Formulae
• Problem Encodings
• Industrial Applications
• Solvers, Simplifiers and 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).

Program Chairs

Armin Biere Johannes Kepler Universität Austria
Carla Gomes Cornell University USA

Program Committee

Dimitris Achlioptas UC Santa Cruz USA
Carlos Ansotegui IIIA Spain
Fahiem Bacchus University of Toronto Canada
Paul Beame University of Washington USA
Alessandro Cimatti ITC-irst Italy
Niklas Eén Cadence Berkeley Labs USA
Enrico Giunchiglia Università di Genova Italy
Holger Hoos University of British Columbia Canada
Henry Kautz University of Washington USA
Hans Kleine Büning Universität Paderborn Germany
James Kukula Synopsys ATG USA
Daniel Le Berre Université d'Artois France
Inês Lynce Universidade Técnica de Lisboa Portugal
Hans van Maaren Universiteit Delft Netherlands
Sharad Malik Princeton University USA
João Marques-Silva University of Southampton UK
Cristopher Moore University of New Mexico / SFI USA
Jussi Rintanen National ICT Australia
Ashish Sabharwal Cornell University USA
Bart Selman Cornell University USA
Carsten Sinz Johannes Kepler Universität Austria
Ewald Speckenmeyer Universität Köln Germany
Ofer Strichman Technion Israel
Stefan Szeider Durham University UK
Allen Van Gelder UC Santa Cruz USA
Miroslav Velev Consultant USA
Toby Walsh National ICT Australia
Lintao Zhang Microsoft Research Silicon Valley USA
Riccardo Zecchina ICTP Italy

SAT Race

Carsten Sinz Johannes Kepler Universität Austria

Nina Amla Cadence Design Systems USA
João Marques-Silva University of Southampton UK
Emmanuel Zarpas IBM Haifa Israel

Daniel Le Berre Université d'Artois France
Laurent Simon Université Paris-Sud France

QBF Evaluation

Massimo Narizzano Università di Genova Italy
Luca Pulina Università di Genova Italy
Armando Tacchella Università di Genova Italy

Pseudo Boolean Evaluation

Vasco Manquinho Universidade Técnica de Lisboa Portugal
Olivier Roussel Université d'Artois France

MAX-SAT Evaluation

Josep Argelich Universitat de Lleida Spain
Chu Min Li Université de Picardie France
Felip Manyà IIIA-CSIC Spain
Jordi Planes Universitat de Lleida Spain

History

The last conference SAT'05 was held in St Andrews, Scotland, and SAT'04 in Vancouver, BC, Canada. The proceedings of SAT 2005 are published as volume 3569 of LNCS. See www.satisfiability.org for more information.