Complete search algorithms for model counting, inference, and optimization problems | Posted on:2009-12-12 | Degree:Ph.D | Type:Dissertation | University:University of Washington | Candidate:Sang, Tian | Full Text:PDF | GTID:1448390005457292 | Subject:Computer Science | Abstract/Summary: | | lthough 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 verification, planning, diagnosis, and other areas. Despite the popularity of SAT,... | Keywords/Search Tags: | SAT | | Related items |
| |
|