ENGLISH

Theory and Applications of Satisfiability Testing – SAT 2010: 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010. Proceedings

By Ofer Strichman , Yehuda Naveh (auth.) , Stefan Szeider (eds.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
2010
ISBN
9783642141867, 3642141862
DOI
10.1007/978-3-642-14186-7
Language
english
Format
PDF
Filesize
5 MB (5472148 bytes)
Series
Lecture Notes in Computer Science 6175 : Theoretical Computer Science and General Issues
Edition
1
Pages
400\411
Time added
2013-04-24 17:00:00
Algorithm Analysis and Problem Complexity; Softwar

Description

This book constitutes the refereed proceedings of the 13th International Conference on Theory and Applications of Satisfiability Testing, SAT 2010, held in Edinburgh, UK, in July 2010 as part of the Federated Logic Conference, FLoC 2010. The 21 revised full papers presented together with 14 revised short papers and 2 invited talks were carefully selected from 75 submissions. The papers cover a broad range of topics such as proof systems and proof complexity; search algorithms and heuristics; analysis of algorithms; combinatorial theory of satisfiability; random instances vs structured instances; problem encodings; industrial applications; applications to combinatorics; solvers, simplifiers and tools; and exact and parameterized algorithms.

Similar books