This book covers recent progress in solving propositional satisfiability and related problems. Propositional satisfiability is a powerful and general formalism used to solve a wide range of important problems including hardware and software verification. Research into methods to automate such reasoning has therefore a long history in artificial intelligence. This book follows on from the highly successful volume entitled SAT 2000 published five years ago.

This book is devoted to the 6th International Conference on Theory and - plications of Satis?ability Testing (SAT 2003) held in Santa Margherita Ligure (Genoa,Italy), during May5-8,2003. SAT 2003followedthe WorkshopsonS- is?ability held in Siena (1996), Paderborn (1998), and Renesse (2000), and the Workshop on Theory and Applications of Satis?ability Testing held in Boston (2001) and in Cincinnati (2002). As in the last edition, the SAT event hosted a SAT solvers competition, and, starting from the 2003 edition, also a Quanti?ed Boolean Formulas (QBFs) solvers comparative evaluation. There were 67 submissions of high quality, authored by researchers from all over the world. All the submissions were thoroughly evaluated, and as a result 42 were selected for oral presentations, and 16 for a poster presentation. The presentations covered the whole spectrum of research in propositional and QBF satis?ability testing, including proof systems, search techniques, probabilistic analysis of algorithms and their properties, problem encodings, industrial app- cations, speci?c tools, case studies and empirical results. Further, the program was enriched by three invited talks, given by Riccardo Zecchina (on "Survey Propagation: from Analytic Results on Random k-SAT to a Message-Passing - gorithm for Satis?ability"), Toby Walsh (on "Challenges in SAT (and QBF)") and Wolfgang Kunz (on "ATPG Versus SAT: Comparing Two Paradigms for Boolean Reasoning"). SAT 2003 thus provided a unique forum for the presen- tion and discussion of research related to the theory and applications of pro- sitional and QBF satis?ability testing.

This book is devoted to recent progress made in solving propositional satisfiability and related problems. Propositional satisfiability is a powerful and general formalism used to solve a wide range of important problems including hardware and software verification. The core of many reasoning problems in automated deduction are propositional. Research into methods to automate such reasoning has therefore a long history in artificial intelligence. In 1957, Allen Newell and Herb Simon introduced the Logic Theory Machine to prove propositional theorems from Whitehead and Russel's Principia mathematica. ...] This book follows on from the highly successful volume entitled SAT 2000 published five years ago. The papers in SAT 2005 fall (not entirely neatly) into the following categories: complete methods, local and stochastic search methods, random problems, applications, and extensions beyond the propositional.