MiniMaxSat: A New Weighted Max-SAT Solver
暂无分享,去创建一个
[1] Yoav Shoham,et al. Towards a universal test suite for combinatorial auction algorithms , 2000, EC '00.
[2] Frédéric Benhamou. Principles and Practice of Constraint Programming - CP 2006, 12th International Conference, CP 2006, Nantes, France, September 25-29, 2006, Proceedings , 2006, CP.
[3] Thomas Schiex,et al. On the Complexity of Compact Coalitional Games , 2009, IJCAI.
[4] Karem A. Sakallah,et al. Pueblo: A Hybrid Pseudo-Boolean SAT Solver , 2006, J. Satisf. Boolean Model. Comput..
[5] Javier Larrosa,et al. Resolution in Max-SAT and its relation to local consistency in weighted CSPs , 2005, IJCAI.
[6] Niklas Sörensson,et al. An Extensible SAT-solver , 2003, SAT.
[7] Albert Oliveras,et al. On SAT Modulo Theories and Optimization Problems , 2006, SAT.
[8] Javier Larrosa,et al. Node and arc consistency in weighted CSP , 2002, AAAI/IAAI.
[9] Niklas Sörensson,et al. Translating Pseudo-Boolean Constraints into SAT , 2006, J. Satisf. Boolean Model. Comput..
[10] Holger H. Hoos,et al. UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT & MAX-SAT , 2004, SAT.
[11] Armin Biere,et al. Theory and Applications of Satisfiability Testing - SAT 2006, 9th International Conference, Seattle, WA, USA, August 12-15, 2006, Proceedings , 2006, SAT.
[12] Felip Manyà,et al. Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers , 2005, CP.
[13] Sharad Malik,et al. Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).
[14] Simon de Givry,et al. A logical approach to efficient Max-SAT solving , 2006, Artif. Intell..
[15] Byungki Cha,et al. Local Search Algorithms for Partial MAXSAT , 1997, AAAI/IAAI.
[16] Felip Manyà,et al. New Inference Rules for Max-SAT , 2007, J. Artif. Intell. Res..
[17] Weixiong Zhang,et al. MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability , 2005, Artif. Intell..
[18] Peter van Beek,et al. Principles and Practice of Constraint Programming - CP 2005, 11th International Conference, CP 2005, Sitges, Spain, October 1-5, 2005, Proceedings , 2005, CP.
[19] Uri Zwick,et al. A 7/8-approximation algorithm for MAX 3SAT? , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[20] Javier Larrosa,et al. New Inference Rules for Efficient Max-SAT Solving , 2006, AAAI.
[21] Teresa Alsinet,et al. Improved Exact Solvers for Weighted Max-SAT , 2005, SAT.
[22] Felip Manyà,et al. Detecting Disjoint Inconsistent Subformulas for Computing Lower Bounds for Max-SAT , 2006, AAAI.
[23] Amnon Meisels,et al. Conflict Directed Backjumping for Max-CSPs , 2007, IJCAI.
[24] Hantao Zhang,et al. Study of Lower Bound Functions for MAX-2-SAT , 2004, AAAI.
[25] Martin C. Cooper,et al. Soft Arc Consistency Applied to Optimal Planning , 2006, CP.
[26] Josep Argelich,et al. Learning Hard Constraints in Max-SAT ⋆ , 2006 .
[27] Simon de Givry,et al. Solving Max-SAT as Weighted CSP , 2003, CP.
[28] Rina Dechter,et al. Principles and Practice of Constraint Programming – CP 2000 , 2001, Lecture Notes in Computer Science.
[29] Josep Argelich,et al. Exact Max-SAT solvers for over-constrained problems , 2006, J. Heuristics.
[30] Simon de Givry,et al. Existential arc consistency: Getting closer to full arc consistency in weighted CSPs , 2005, IJCAI.
[31] Inês Lynce,et al. Probing-based preprocessing techniques for propositional satisfiability , 2003, Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence.
[32] Vasco M. Manquinho,et al. Satisfiability-Based Algorithms for Boolean Optimization , 2004, Annals of Mathematics and Artificial Intelligence.
[33] Francesca Rossi,et al. Principles and Practice of Constraint Programming – CP 2003 , 2003, Lecture Notes in Computer Science.
[34] Inês Lynce,et al. Efficient data structures for backtrack search SAT solvers , 2005, Annals of Mathematics and Artificial Intelligence.
[35] Toby Walsh,et al. SAT v CSP , 2000, CP.