Solving the minimum-cost satisfiability problem using sat based branch-and-bound search

IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD

Volumn , Issue , 2006, Pages 852-859

  Fu, Zhaohui ^a   Malik, Sharad ^a  

^a Princeton University   (United States)

Author keywords

Boolean satisfiability; Branch and bound; MinCostSAT

Indexed keywords

ARTIFICIAL INTELLIGENCE; AUTOMATIC TEST PATTERN GENERATION; BIONICS; BOOLEAN ALGEBRA; COMPUTER AIDED DESIGN; COMPUTER AIDED SOFTWARE ENGINEERING; DATA COMPRESSION; DESIGN; ELECTRONICS ENGINEERING; MODEL CHECKING; ROUTING ALGORITHMS; TESTING;

AI PLANNING; AUTOMATIC TEST-PATTERN GENERATION (ATPG); BOOLEAN CONSTRAINTS; BOOLEAN SATISFIABILITY (SAT); BOUNDED MODEL CHECKING (BMC); COMPUTER-AIDED DESIGN; COVERING ALGORITHMS; CURRENT GENERATION; ELECTRONIC DESIGN AUTOMATION (EDA); GENERAL (CO); GRAPH COLORINGS; HIGHLY EFFICIENT; INTERNATIONAL CONFERENCES; ORDER-OF MAGNITUDES; SAT PROBLEMS; SATISFIABILITY (SAT) PROBLEMS; TEST PATTERN GENERATION (TPG); VARIATIONS OF;

BOOLEAN FUNCTIONS;

EID: 46149116824     PISSN: 10923152     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCAD.2006.320089     Document Type: Conference Paper

References (21)

1. P. Barth. A Davis-Putnam enumeration algorithm for linear pseudo-Boolean optimization. Technical Report MPI-I-95-2-003, Max Plank Institute Computer Science, 1995.
2. O. Coudert. Two-level logic minimization: An overview. Integration the VLSI journal, 17(2):97-140, 1994.
3. O. Coudert. On solving covering problems. In Proceedings of the 33rd Design Automation Conference (DAC'96), pages 197-202, 1996.
4. O. Coudert and J. C. Madre. New ideas for solving covering problems. In Proceedings of the 32nd Design Automation Conference (DAC'95), pages 641-646, 1995.
5. N. Eén and N. Sörensson. The MiniSat page, http://www.cs.Chalmers.se/Cs/Research/ FormalMethods/MiniSat/, 2006.
6. P. Flores, H. Neto, and J. Marques-Silva. An exact solution to the minimum size test pattern problem. IEEE Transactions on Design Automation of Electronic Systems, 6(4):629-644, 2001.
7. Z. Fu and S. Malik. On solving the Partial MAX-SAT problem. In International Conference on Theory and Applications of Satisfiability Testing (SAT'06), LNCS 4121, pages 252-265, 2006.
8. R. Gomory. Outline of an algorithm for integer solution to linear programs. Bulletin of the American Mathematical Society, 64:275-278, 1958.
9. H. H. Hoos and T. Stützle. SATLIB: An online resource for research on SAT, http://www.satlib.org. SAT 2000, pages 283-292, 2000.
10. ILOG. Cplex homepage, http://www.ilog.com/products/cplex/, 2006.
11. D. S. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9:256-278, 1974.
12. S. Khanna, M. Sudan, L. Trevisan, and D. Williamson. The approximability of constraint satisfaction problems. SIAM Journal of Computing, 30(6):1863-1920, 2000.
13. X. Y. Li. Optimization Algorithms for the Minimum-Cost Satisfiability Problem. PhD thesis, Department of Computer Science, North Carolina State University, Raleigh, North Carolina, 2004. 162 pages.
14. S. Liao and S. Devadas. Solving covering problems using LPR-based lower bounds. In Proceedings of the 34th Design Automation Conference (DAC'97), pages 117-120, 1997.
15. V. Manquinho, P. Flores, J. Marques-Silva, and A. Oliverira. Prime implicant computation using satisfiability algorithms. In Proceedings of the IEEE International Conference on Tools with Artificial Intelligence (ICTAI'99), pages 117-120, 1999.
16. V. Manquinho and J. Marques-Silva. Search pruning techniques in SAT-based branch-and-bound algorithms for the binate covering problem. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 21:505-516, 2002.
17. V. Manquinho and O. Roussel. Pseudo-Boolean evaluation 2005 http://www.cril.univ-artois.fr/PB05/, August 2005.
18. J. Marques-Silva and K. A. Sakallah. GRASP: A search algorithm for propositional satisfiability. IEEE Transactions on Computers, 48:506-521, 1999.
19. S. Miyazaki, K. Iwama, and Y. Kambayashi. Database queries as combinatorial optimization problems. In Proceedings of the International Symposium on Cooperative Database Systems for Advanced Applications, pages 448-54, 1996.
20. M. W. Moskewicz, C. F. Madigan, Y Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Proceedings of the 38th Design Automation Conference (DAC'01), 2001.
21. S. Yang. Logic synthesis and optimization benchmarks user guide. Technical Report 1991-IWLS-UG-Saeyang, MCNC, Research Triangle Park, NC, 1991.