This volume contains the papers presented at the 11th International Conference on Theory and Applications of Satis?ability Testing (SAT 2008). The series of International Conferences on Theory and Applications of S- is?ability Testing (SAT) has evolved from a ?rst workshop on SAT in 1996 to an annual international conference which is a platform for researchers studying various aspects of the propositional satis?ability problem and its applications. In the past, the SAT conference venue alternated between Europe and North America. For the ?rst time, the conference venue was in Asia, more precisely at the Zhudao Guest House, near Sun Yat-Sen University in Guangzhou, P. R. China. Many hard combinatorial problems can be encoded into SAT. Therefore - provementsonheuristics onthe practicalside,as wellastheoreticalinsightsinto SAT apply to a large range of real-world problems. More speci?cally, many - portant practical veri?cation problems can be rephrased as SAT problems. This applies to veri?cation problems in hardware and software. Thus SAT is bec- ing 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, s- pli?ers, tools, case studies, and empirical results. SAT is interpreted in a rather broad sense: besides propositional satis?ability, it includes, for example, the - main of quanti?ed Boolean formulae (QBF) and satis?ability modulo theories (SMT).

From the Back Cover

This book constitutes the refereed proceedings of the 11th International Conference on Theory and Applications of Satisfiability Testing, SAT 2008, held in Guangzhou, P. R. China, in May 2008.

The 17 revised full papers presented together with 8 revised short papers and 2 invited talks were carefully selected from 70 submissions. All current research issues in propositional and quantified Boolean formula satisfiability testing are covered, including but 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.

"About this title" may belong to another edition of this title.

Store Description

We carry a wide selection of books from South Asia, United States, UK.

Visit Seller's Storefront

Seller's business information

Readingos GmbH
Kaiserstra�e 47, Frankfurt am Main, 60329, Germany

Sale & Shipping Terms

Terms of Sale

Shipping Terms

To ensure faster delivery, books may be shipped from any of the following locations Germany, the United Kingdom (UK), the United States (US), based on the buyer's address and product availability.

Shipping rates from Germany to U.S.A.

Shipping rates from Germany to U.S.A.
Order quantity	25 to 45 business days	8 to 14 business days
First item	US$ 11.68	US$ 21.95

Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.