A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Solving the minimum-cost satisfiability problem using SAT based branch-and-bound search
2006
Computer-Aided Design (ICCAD), IEEE International Conference on
Boolean Satisfiability (SAT) has seen many successful applications in various fields, such as Electronic Design Automation (EDA) and Artificial Intelligence (AI). However, in some cases it may be required/preferable to use variations of the general SAT problem. In this paper we consider one important variation, the Minimum-Cost Satisfiability Problem (MinCostSAT). MinCostSAT is a SAT problem which minimizes the cost of the satisfying assignment. MinCostSAT has various applications, e.g.
doi:10.1145/1233501.1233681
dblp:conf/iccad/FuM06
fatcat:e575tusipbdvta4tjsmvb3wu4q