On Solving the Partial MAX-SAT Problem
暂无分享,去创建一个
Sharad Malik | Zhaohui Fu | S. Malik | Z. Fu
[1] David S. Johnson,et al. Approximation algorithms for combinatorial problems , 1973, STOC.
[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[3] M. Garey. Johnson: computers and intractability: a guide to the theory of np- completeness (freeman , 1979 .
[4] I. Koren. Computer arithmetic algorithms , 2018 .
[5] Bart Selman,et al. A general stochastic approach to solving problems with hard and soft constraints , 1996, Satisfiability Problem: Theory and Applications.
[6] Olivier Coudert,et al. On solving covering problems , 1996, DAC '96.
[7] Yahiko Kambayashi,et al. Database Queries as Combinatorial Optimization Problems , 1996, CODAS.
[8] Byungki Cha,et al. Local Search Algorithms for Partial MAXSAT , 1997, AAAI/IAAI.
[9] Joao Marques-Silva,et al. GRASP: A Search Algorithm for Propositional Satisfiability , 1999, IEEE Trans. Computers.
[10] M. Moskewicz,et al. Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).
[11] Ofer Shtrichman. Pruning Techniques for the SAT-Based Bounded Model Checking Problem , 2001 .
[12] Ofer Strichman,et al. Pruning Techniques for the SAT-Based Bounded Model Checking Problem , 2001, CHARME.
[13] Vasco M. Manquinho,et al. Search pruning techniques in SAT-based branch-and-bound algorithmsfor the binate covering problem , 2002, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[14] Sharad Malik,et al. Validating SAT solvers using an independent resolution-based checker: practical implementations and other applications , 2003, 2003 Design, Automation and Test in Europe Conference and Exhibition.
[15] Lawrence Ryan. Efficient algorithms for clause-learning SAT solvers , 2004 .
[16] Randy H. Katz,et al. Contemporary Logic Design , 2004 .
[17] Matthias F. Stallmann,et al. Optimization algorithms for the minimum-cost satisfiability problem , 2004 .
[18] Josep Argelich,et al. Solving Over-Constrained Problems with SAT Technology , 2005, SAT.
[19] Eugene Goldberg,et al. BerkMin: A Fast and Robust Sat-Solver , 2002, Discret. Appl. Math..