Overview
- Up-to-date results
- Fast track conference proceedings
- State-of-the-art report
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 6695)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Included in the following conference series:
Conference proceedings info: SAT 2011.
Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
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.
Similar content being viewed by others
Keywords
Table of contents (37 papers)
-
Technical Program
-
Session 4: Extraction of Minimal Unsatisfiable Subsets
-
Session 6: Quantified Boolean Formulae
Other volumes
-
Theory and Applications of Satisfiability Testing - SAT 2011
Editors and Affiliations
Bibliographic Information
Book Title: Theory and Application of Satisfiability Testing
Book Subtitle: 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011, Proceedings
Editors: Karem A. Sakallah, Laurent Simon
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-642-21581-0
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag GmbH Berlin Heidelberg 2011
Softcover ISBN: 978-3-642-21580-3Published: 01 June 2011
eBook ISBN: 978-3-642-21581-0Published: 11 June 2011
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XIII, 371
Number of Illustrations: 35 b/w illustrations, 28 illustrations in colour
Topics: Logics and Meanings of Programs, Computation by Abstract Devices, Algorithm Analysis and Problem Complexity, Mathematical Logic and Formal Languages, Artificial Intelligence, Logic Design