Editors:
- 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)
Conference series link(s): SAT: International Conference on Theory and Applications of Satisfiability Testing
Conference proceedings info: SAT 2011.
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (37 papers)
-
Front Matter
-
Technical Program
-
Session 4: Extraction of Minimal Unsatisfiable Subsets
-
Session 6: Quantified Boolean Formulae
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.
Editors and Affiliations
-
University of Michigan, Ann Arbor, USA
Karem A. Sakallah
-
LRI / CNRS UMR8623 / INRIA Saclay, Univ Paris-Sud, Orsay, France
Laurent Simon
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