Editors:
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 4996)
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 2008.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsThis is a preview of subscription content, access via your institution.
Table of contents (27 papers)
-
Front Matter
About this book
Keywords
- 3-SAT
- Erfüllbarkeitsproblem der Aussagenlogik
- Resolution
- algorithm
- algorithms
- complexity
- constraint programming
- local search
- logic
- optimization
- probabilistic algorithms
- proof
- proof systems
- proof theory
- random walks
- algorithm analysis and problem complexity
Bibliographic Information
Book Title: Theory and Applications of Satisfiability Testing – SAT 2008
Book Subtitle: 11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008, Proceedings
Editors: Hans Kleine Büning, Xishun Zhao
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-540-79719-7
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag Berlin Heidelberg 2008
Softcover ISBN: 978-3-540-79718-0Published: 25 April 2008
eBook ISBN: 978-3-540-79719-7Published: 07 May 2008
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: X, 305
Topics: Formal Languages and Automata Theory, Algorithms, Operating Systems, Numerical Analysis, Artificial Intelligence, Mathematical Logic and Foundations