Theory and applications of satisfiability testing

Autori

• Hans Kleine Büning

Parametri

• Computer, IT, programmazione

Maggiori informazioni sul libro

This volume features papers from the 11th International Conference on Theory and Applications of Satisfiability Testing (SAT 2008), which has evolved from a workshop in 1996 to an annual international conference. It serves as a platform for researchers exploring various aspects of the propositional satisfiability problem and its applications. For the first time, the conference took place in Asia, specifically at the Zhudao Guest House near Sun Yat-Sen University in Guangzhou, P. R. China. Many complex combinatorial problems can be represented as SAT problems, leading to advancements in both practical heuristics and theoretical insights applicable to a wide array of real-world challenges. Notably, significant verification issues in hardware and software can be reformulated as SAT problems, making SAT a crucial technology for ensuring secure and reliable systems. The conference topics encompass both practical and theoretical research on SAT and its applications, including proof systems, proof complexity, search algorithms, heuristics, algorithm analysis, hard instances, randomized formulas, problem encodings, industrial applications, solvers, tools, case studies, and empirical results. SAT is broadly defined, encompassing not only propositional satisfiability but also quantified Boolean formulas (QBF) and satisfiability modulo theories (SMT).

Lingua: Inglese

Pubblicato: 2008