Ebook: Theory and Applications of Satisfiability Testing – SAT 2008: 11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008. Proceedings
- Genre: Education // International Conferences and Symposiums
- Tags: Mathematical Logic and Formal Languages, Algorithm Analysis and Problem Complexity, Operating Systems, Numeric Computing, Artificial Intelligence (incl. Robotics), Mathematical Logic and Foundations
- Series: Lecture Notes in Computer Science 4996 : Theoretical Computer Science and General Issues
- Year: 2008
- Publisher: Springer-Verlag Berlin Heidelberg
- Edition: 1
- Language: English
- pdf
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.
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.