暂无分享,去创建一个
[1] Eugene Goldberg,et al. BerkMin: A Fast and Robust Sat-Solver , 2002, Discret. Appl. Math..
[2] Weixiong Zhang,et al. Efficient Strategies for (Weighted) Maximum Satisfiability , 2004, CP.
[3] Chu Min Li,et al. Diversification and Determinism in Local Search for Satisfiability , 2005, SAT.
[4] Chu Min Li,et al. A Constraint-Based Approach to Narrow Search Trees for Satisfiability , 1999, Inf. Process. Lett..
[5] Donald W. Loveland,et al. A machine program for theorem-proving , 2011, CACM.
[6] Chu Min Li,et al. Heuristics Based on Unit Propagation for Satisfiability Problems , 1997, IJCAI.
[7] Hantao Zhang,et al. Study of Lower Bound Functions for MAX-2-SAT , 2004, AAAI.
[8] Martin C. Cooper. Reduction operations in fuzzy or valued constraint satisfaction , 2003, Fuzzy Sets Syst..
[9] Joao Marques-Silva,et al. GRASP: A Search Algorithm for Propositional Satisfiability , 1999, IEEE Trans. Computers.
[10] Jinchang Wang,et al. Solving propositional satisfiability problems , 1990, Annals of Mathematics and Artificial Intelligence.
[11] Josep Argelich,et al. Partial Max-SAT Solvers with Clause Learning , 2007, SAT.
[12] Clifford Stein,et al. Introduction to Algorithms, 2nd edition. , 2001 .
[13] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .
[14] Rolf Niedermeier,et al. Faster exact algorithms for hard problems: A parameterized point of view , 2001, Discret. Math..
[15] Eugene C. Freuder,et al. Comparative studies of constraint satisfaction and Davis-Putnam algorithms for maximum satisfiability problems , 1993, Cliques, Coloring, and Satisfiability.
[16] Hantao Zhang,et al. Improving exact algorithms for MAX-2-SAT , 2005, Annals of Mathematics and Artificial Intelligence.
[17] Sharad Malik,et al. Efficient conflict driven learning in a Boolean satisfiability solver , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).
[18] Javier Larrosa,et al. Resolution in Max-SAT and its relation to local consistency in weighted CSPs , 2005, IJCAI.
[19] Richard J. Wallace,et al. Directed Arc Consistency Preprocessing , 1995, Constraint Processing, Selected Papers.
[20] Martin C. Cooper. High-Order Consistency in Valued Constraint Satisfaction , 2005, Constraints.
[21] Simon de Givry,et al. Solving Max-SAT as Weighted CSP , 2003, CP.
[22] Simon de Givry,et al. A logical approach to efficient Max-SAT solving , 2006, Artif. Intell..
[23] Hilary Putnam,et al. A Computing Procedure for Quantification Theory , 1960, JACM.
[24] Javier Larrosa,et al. Partition-Based Lower Bound for Max-CSP , 1999, Constraints.
[25] Felip Manyà,et al. Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers , 2005, CP.
[26] Wei Li,et al. Many hard examples in exact phase transitions , 2003, Theor. Comput. Sci..
[27] Maria Luisa Bonet,et al. The Logic Behind Weighted CSP , 2007, IJCAI.
[28] J. Freeman. Improvements to propositional satisfiability search algorithms , 1995 .
[29] Maria Luisa Bonet,et al. Resolution for Max-SAT , 2007, Artif. Intell..
[30] Josep Argelich,et al. Exact Max-SAT solvers for over-constrained problems , 2006, J. Heuristics.
[31] Thomas Schiex,et al. Maintaining Reversible DAC for Max-CSP , 1999, Artif. Intell..
[32] Simon de Givry,et al. Existential arc consistency: Getting closer to full arc consistency in weighted CSPs , 2005, IJCAI.
[33] Ke Xu,et al. A Simple Model to Generate Hard Satisfiable Instances , 2005, IJCAI.
[34] Teresa Alsinet,et al. Improved Exact Solvers for Weighted Max-SAT , 2005, SAT.
[35] Jordi Planes. Improved Branch and Bound Algorithms for Max-2-SAT and Weighted Max-2-SAT , 2003, CP.
[36] Endre Boros,et al. Pseudo-Boolean optimization , 2002, Discret. Appl. Math..
[37] Henry A. Kautz,et al. Understanding the power of clause learning , 2003, IJCAI 2003.
[38] Felip Manyà,et al. Exact Algorithms for MAX-SAT , 2003, FTP.
[39] Venkatesh Raman,et al. Upper Bounds for MaxSat: Further Improved , 1999, ISAAC.
[40] Ronald L. Rivest,et al. Introduction to Algorithms, Second Edition , 2001 .
[41] Javier Larrosa,et al. New Inference Rules for Efficient Max-SAT Solving , 2006, AAAI.
[42] Maria Luisa Bonet,et al. A Complete Calculus for Max-SAT , 2006, SAT.
[43] Hantao Zhang,et al. SATO: An Efficient Propositional Prover , 1997, CADE.
[44] Teresa Alsinet,et al. Improved branch and bound algorithms for Max-SAT , 2003 .
[45] Chu Min Li,et al. Look-Ahead Versus Look-Back for Satisfiability Problems , 1997, CP.
[46] Teresa Alsinet,et al. A Max-SAT Solver with Lazy Data Structures , 2004, IBERAMIA.
[47] Weixiong Zhang,et al. MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability , 2005, Artif. Intell..
[48] Felip Manyà,et al. Detecting Disjoint Inconsistent Subformulas for Computing Lower Bounds for Max-SAT , 2006, AAAI.
[49] Rolf Niedermeier,et al. New Upper Bounds for Maximum Satisfiability , 2000, J. Algorithms.
[50] Brian Borchers,et al. A Two-Phase Exact Algorithm for MAX-SAT and Weighted MAX-SAT Problems , 1998, J. Comb. Optim..
[51] Christian Bessiere,et al. New Lower Bounds of Constraint Violations for Over-Constrained Problems , 2001, CP.
[52] Josep Argelich,et al. Solving Over-Constrained Problems with SAT Technology , 2005, SAT.
[53] Maria Luisa Bonet,et al. Inference Rules for High-Order Consistency in Weighted CSP , 2007, AAAI.