Theory and Applications of Satisfiability Testing - SAT 2010: 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010, Proceedings
Ofer Strichman, Stefan Szeider
Springer, Jul 9, 2010 - Computers - 400 pages
Annotation. 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.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
Theory and Applications of Satisfiability Testing - SAT 2010: 13th ...
Ofer Strichman,Stefan Szeider
No preview available - 2010
Common terms and phrases
applied backtracking benchmarks Berlin Heidelberg 2010 blackbox blackbox outputs Büchi automata circuit clause learning CNF formula complexity Computer conjunctive normal form constraints contains Craig interpolants default logic defined delta debugging denote dependency schemes DMRP Dtriv encoding equivalent evaluation existential exponential flips function fuzz testing gate graph GSAT Heidelberg heuristic input instances k-SAT Lemma literals LNCS logic lower bound MaxSAT method minimal MiniSAT model checking moderately exponential NP-complete number of clauses number of variables obtained occurs optimal parameter performance polynomial preprocessing problem propagation propositional pseudo-Boolean PSPACE-complete QBF solvers QDPLL Quantified Boolean Formulas reduction regular random resolution SAT solvers satisfying assignment sequent SLS algorithms solution solved Springer sQueezeBF Strichman structure symmetry Szeider Eds tabu search Tacchella techniques Theorem threshold truth assignment unsat unsatisfiable upper bound variable elimination vertex Walksat XSAT