SAT 2006
		      Final Call for Papers

	         9th International Conference on
	Theory and Applications of Satisfiability Testing

	     August 12 - 15, Seattle, Washington, USA

	            http://fmv.jku.at/sat06 


  The International Conference on Theory and Applications of
  Satisfiability Testing is the primary annual meeting for
  researchers studying the propositional satisfiability problem
  (SAT). SAT'06 is part of FLOC'06, the fourth Federated Logic
  Conference, which will host, in addition to SAT, LICS, RTA, CAV,
  ICLP and IJCAR. SAT'05 was held in St Andrews, Scotland, and SAT'04
  in Vancouver, BC, Canada.  This time SAT'06 features the SAT'06
  Race in spirit of the SAT Competitions, the first competitive
  QBF'06 Evaluation, an Evaluation of Pseudo-Boolean Solvers and
  the Workshop on Satisfiability Solvers and Program Verification
  (SSPV'06).

SCOPE 

  Many hard combinatorial problems can be encoded into
  SAT. Therefore improvements on heuristics on the practical, as
  well as theoretical insights 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, 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).

SUBMISSION

  Submissions should contain original material and can either be
  regular research papers up to 14 pages or short papers up to 6
  pages. Double submissions including submissions as short and long
  papers will be rejected.  Submissions should use the Springer
  LNCS style. All appendices, tables, figures and the bibliography
  must fit into the page limit. Submissions deviating from these
  requirements may be rejected without review. All accepted papers
  including short papers will be published in the proceedings of the
  conference. We are currently negotiating with Springer to publish
  the proceedings within the LNCS series. The submission page will go
  online in mid February.  Papers and abstracts have to be submitted
  electronically as PDF files.  Abstracts for intended submissions
  should be submitted by March 10. Full papers are due on March 17.

PROGRAM CHAIRS

  Armin Biere, Johannes Kepler University, Austria
  Carla Gomes, Cornell University, USA

IMPORTANT DATES

  March 10, Abstract Submission
  March 17, Paper Submission
  April 28, Author Notification
  May 19, Final Version

PROGRAM COMITTEE

  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 Een, Cadence Design Systems, USA
  Enrico Giunchiglia, University of Genova, Italy
  Holger Hoos, University of British Columbia, Canada
  Henry Kautz, University of Washington, USA
  Hans Kleine Buning, University of Paderborn, Germany
  James Kukula, Synopsys ATG, USA
  Daniel Le Berre, University of Artois, France
  Ines Lynce, Technical University of Lisbon, Portugal
  Hans van Maaren, University of Delft, Netherlands
  Sharad Malik, Princeton University, USA
  Joao 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 University, Austria
  Ewald Speckenmeyer, University of Cologne, 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, USA
  Riccardo Zecchina, ICTP, Italy

SAT RACE
  
  Carsten Sinz, Johannes Kepler University, Austria

  Nina Amla, Cadence Design Systems, USA
  Joao Marques-Silva, University of Southampton, UK
  Emmanuel Zarpas, IBM Haifa Research Lab, Israel

  Daniel Le Berre, University of Artois, France
  Laurent Simon, University Paris-Sud, France

QBF EVALUATION

  Massimo Narizzano, University of Genova, Italy
  Luca Pulina, University of Genova, Italy
  Armando Tacchella, University of Genova, Italy

PSEUDO BOOLEAN EVALUATION

  Olivier Roussel, University of Artois, France
  Vasco Manquinho, Technical University of Lisbon, Portugal