Handbook of Satisfiability
IOS Press, 2009 - Computers - 966 pages
A collection of papers on various theoretical and practical aspects of SAT solving. It is suitable for students and researchers.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
algorithm applied approach Artificial Intelligence autarky backtracking binary clauses Boolean functions branching tuples circuit clause-sets CNF formula complexity Computer Science Conference on Artificial conflict consider Constraint Programming constraint satisfaction problems corresponding decision defined denote DPLL DPLL algorithm efficient encoding equivalent example existential exponential fixed-parameter fixed-parameter tractable formula F heuristics IEEE implication graph input instance integer International Conference Latin square Lecture Notes linear literals local search logic look-ahead lower bound Mathematics MaxSAT method minimally unsatisfiable modal model checking model counting node Notes in Computer NP-complete optimization partial assignment permutation polynomial predicate Proc procedure Proceedings propositional formulas quantified Boolean formulas random k-SAT reduced resolution rule SAT solvers satisfiability problem Satisfiability Testing satisﬁable satisfying assignment search space Section solution solving Springer SSAT subset Survey Propagation symmetries techniques Theorem theory truth assignment unit clause unit propagation upper bound