| Theory and Applications of Satisfiability Testing - SAT 2008: 11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008, Proceedings 2008 Edition Contributor(s): Kleine Büning, Hans (Editor), Zhao, Xishun (Editor) |
|
 |
ISBN: 3540797181 ISBN-13: 9783540797180 Publisher: Springer OUR PRICE: $52.24 Product Type: Paperback Published: May 2008 |
| Additional Information |
| BISAC Categories: - Mathematics | Logic - Computers | Operating Systems - General - Computers | Computer Science |
| Dewey: 005.101 |
| Series: Lecture Notes in Computer Science |
| Physical Information: 0.8" H x 6.1" W x 9.2" (1.05 lbs) 305 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: 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) |