Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers
暂无分享,去创建一个
[1] 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).
[2] Rolf Niedermeier,et al. New Upper Bounds for Maximum Satisfiability , 2000, J. Algorithms.
[3] V. Vinay,et al. Branching rules for satisfiability , 1995, Journal of Automated Reasoning.
[4] Simon de Givry,et al. Solving Max-SAT as Weighted CSP , 2003, CP.
[5] Gert Smolka. Principles and Practice of Constraint Programming-CP97 , 1997, Lecture Notes in Computer Science.
[6] J. P. Marques,et al. GRASP : A Search Algorithm for Propositional Satisfiability , 1999 .
[7] Eugene Goldberg,et al. BerkMin: A Fast and Robust Sat-Solver , 2002 .
[8] Weixiong Zhang,et al. Efficient Strategies for (Weighted) Maximum Satisfiability , 2004, CP.
[9] Hector J. Levesque,et al. A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.
[10] Chu Min Li,et al. Heuristics Based on Unit Propagation for Satisfiability Problems , 1997, IJCAI.
[11] Hantao Zhang,et al. Study of Lower Bound Functions for MAX-2-SAT , 2004, AAAI.
[12] Teresa Alsinet,et al. A Max-SAT Solver with Lazy Data Structures , 2004, IBERAMIA.
[13] Teresa Alsinet,et al. Improved Exact Solvers for Weighted Max-SAT , 2005, SAT.
[14] Mark Wallace,et al. Principles and Practice of Constraint Programming – CP 2004 , 2004, Lecture Notes in Computer Science.
[15] Felip Manyà,et al. Exact Algorithms for MAX-SAT , 2003, FTP.
[16] Eugene C. Freuder,et al. Anytime algorithms for constraint satisfaction and SAT problems , 1996, SGAR.
[17] Jesus A. Gonzalez,et al. Advances in Artificial Intelligence – IBERAMIA 2004 , 2004, Lecture Notes in Computer Science.
[18] Francesca Rossi,et al. Principles and Practice of Constraint Programming – CP 2003 , 2003, Lecture Notes in Computer Science.
[19] Brian Borchers,et al. A Two-Phase Exact Algorithm for MAX-SAT and Weighted MAX-SAT Problems , 1998, J. Comb. Optim..
[20] Hantao Zhang,et al. SATO: An Efficient Propositional Prover , 1997, CADE.
[21] Teresa Alsinet,et al. Improved branch and bound algorithms for Max-SAT , 2003 .
[22] Chu Min Li,et al. Look-Ahead Versus Look-Back for Satisfiability Problems , 1997, CP.
[23] Jinchang Wang,et al. Solving propositional satisfiability problems , 1990, Annals of Mathematics and Artificial Intelligence.
[24] Rolf Niedermeier,et al. Faster exact algorithms for hard problems: A parameterized point of view , 2001, Discret. Math..
[25] Pedro Meseguer,et al. Current Approaches for Solving Over-Constrained Problems , 2004, Constraints.