books.google.fr - Although NP-complete problems including satisfiability testing (SAT) are traditionally thought as intractable, the efficiency of SAT solvers has been hugely improved over the past decade and a half, and modern SAT solvers are successfully used to solve many practical hard problems in hardware/software...http://books.google.fr/books/about/Complete_Search_Algorithms_for_Model_Cou.html?hl=fr&id=H5ZWLgcsc-8C&utm_source=gb-gplus-shareComplete Search Algorithms for Model Counting, Inference, and Optimization Problems
