Theory and Applications of Satisfiability Testing Book

	Satisfiability and computing van der Waerden numbers	1
	An algorithm for SAT above the threshold	14
	Watched data structures for QBF solvers	25
	How good can a resolution based SAT-solver be?	37
	A local search SAT solver using an effective switching strategy and an efficient unit propagation	53
	Density condensation of Boolean formulas	69
	SAT based predicate abstraction for hardware verification	78
	On Boolean models for quantified Boolean horn formulas	93
	Local search on SAT-encoded colouring problems	105
	A study of pure random walk on random satisfiability problems with "physical" methods	120
	Hidden threshold phenomena for fixed-density SAT-formulae	135
	Improving a probabilistic 3-SAT algorithm by dynamic search and independent clause pairs	150
	Width-based algorithms for SAT and CIRCUIT-SAT	162
	Linear time algorithms for some not-all-equal satisfiability problems	172
	On fixed-parameter tractable parameterizations of SAT	188
	On the probabilistic approach to the random satisfiability problem	203
	Comparing different prenexing strategies for quantified Boolean formulas	214
	Solving error correction for large data sets by means of a SAT solver	229
	Using problem structure for efficient clause learning	242
	Abstraction-driven SAT-based analysis of security protocols	257
	A case for efficient solution enumeration	272
	Cache performance of SAT solvers : a case study for efficient implementation of algorithms	287
	Local consistencies in SAT	299
	Guiding SAT diagnosis with tree decompositions	315
	On computing k-CNF formula properties	330
	Effective preprocessing with hyper-resolution and equality reduction	341
	Read-once unit resolution	356
	The interaction between inference and branching heuristics	370
	Hypergraph reductions and satisfiability problems	383
	SBSAT : a state-based, BDD-based satisfiability solver	398
	Computing vertex eccentricity in exponentially large graphs : QBF formulation and solution	411
	The combinatorics of conflicts between clauses	426
	Conflict-based selection of branching rules	441
	The essentials of the SAT 2003 competition	452
	Challenges in the QBF arena : the SAT'03 evaluation of QBF solvers	468
	kcnfs : an efficient solver for random k-SAT formulae	486
	An extensible SAT-solver	502
	Survey and belief propagation on random K-SAT	519
	Author index	529