Ebook: Theory and Applications of Satisfiability Testing - SAT 2011: 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings
- Tags: Logics and Meanings of Programs, Computation by Abstract Devices, Algorithm Analysis and Problem Complexity, Mathematical Logic and Formal Languages, Artificial Intelligence (incl. Robotics), Logic Design
- Series: Lecture Notes in Computer Science 6695 : Theoretical Computer Science and General Issues
- Year: 2011
- Publisher: Springer-Verlag Berlin Heidelberg
- Edition: 1
- Language: English
- pdf
This book constitutes the refereed proceedings of the 14th International Conference on Theory and Applications of Satisfiability Testing, SAT 2011, held in Ann Arbor, MI, USA in June 2011.
The 25 revised full papers presented together with abstracts of 2 invited talks and 10 poster papers were carefully reviewed and selected from 57 submissions. The papers are organized in topical sections on complexity analysis, binary decision diagrams, theoretical analysis, extraction of minimal unsatisfiable subsets, SAT algorithms, quantified Boolean formulae, model enumeration and local search, and empirical evaluation.
Download the book Theory and Applications of Satisfiability Testing - SAT 2011: 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings for free or read online
Continue reading on any device:
Last viewed books
Related books
{related-news}
Comments (0)