MiniMaxSAT: An Efficient Weighted Max-SAT solver
暂无分享,去创建一个
[1] Albert Oliveras,et al. On SAT Modulo Theories and Optimization Problems , 2006, SAT.
[2] Torsten Fahle,et al. Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique , 2002, ESA.
[3] Simon de Givry,et al. A logical approach to efficient Max-SAT solving , 2006, Artif. Intell..
[4] Donald W. Loveland,et al. A machine program for theorem-proving , 2011, CACM.
[5] Inês Lynce,et al. Efficient data structures for backtrack search SAT solvers , 2005, Annals of Mathematics and Artificial Intelligence.
[6] Uri Zwick,et al. A 7/8-approximation algorithm for MAX 3SAT? , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[7] P. Barth. A Davis-Putnam based enumeration algorithm for linear pseudo-Boolean optimization , 1995 .
[8] Jinchang Wang,et al. Solving propositional satisfiability problems , 1990, Annals of Mathematics and Artificial Intelligence.
[9] Vasco M. Manquinho,et al. Satisfiability-Based Algorithms for Boolean Optimization , 2004, Annals of Mathematics and Artificial Intelligence.
[10] Weixiong Zhang,et al. MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability , 2005, Artif. Intell..
[11] Byungki Cha,et al. Local Search Algorithms for Partial MAXSAT , 1997, AAAI/IAAI.
[12] Tuomas Sandholm,et al. An algorithm for optimal winner determination in combinatorial auctions , 1999, IJCAI 1999.
[13] Felip Manyà,et al. Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers , 2005, CP.
[14] Javier Larrosa,et al. Resolution in Max-SAT and its relation to local consistency in weighted CSPs , 2005, IJCAI.
[15] Yoav Shoham,et al. A Test Suite for Combinatorial Auctions , 2005 .
[16] Tuomas Sandholm,et al. Algorithm for optimal winner determination in combinatorial auctions , 2002, Artif. Intell..
[17] Josep Argelich,et al. Partial Max-SAT Solvers with Clause Learning , 2007, SAT.
[18] Matthias F. Stallmann,et al. The Role of a Skeptic Agent in Testing and Benchmarking of SAT Algorithms , 2002 .
[19] 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).
[20] Holger H. Hoos,et al. UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT & MAX-SAT , 2004, SAT.
[21] Felip Manyà,et al. New Inference Rules for Max-SAT , 2007, J. Artif. Intell. Res..
[22] Inês Lynce,et al. Efficient data structures for backtrack search SAT solvers , 2005 .
[23] Joao Marques-Silva,et al. GRASP-A new search algorithm for satisfiability , 1996, Proceedings of International Conference on Computer Aided Design.
[24] Josep Argelich,et al. Exact Max-SAT solvers for over-constrained problems , 2006, J. Heuristics.
[25] Simon de Givry,et al. Existential arc consistency: Getting closer to full arc consistency in weighted CSPs , 2005, IJCAI.
[26] Inês Lynce,et al. Probing-based preprocessing techniques for propositional satisfiability , 2003, Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence.
[27] Josep Argelich,et al. Learning Hard Constraints in Max-SAT ⋆ , 2006 .
[28] Simon de Givry,et al. Solving Max-SAT as Weighted CSP , 2003, CP.
[29] Daniel Le Berre. Exploiting the real power of unit propagation lookahead , 2001, Electron. Notes Discret. Math..
[30] Hantao Zhang,et al. Study of Lower Bound Functions for MAX-2-SAT , 2004, AAAI.
[31] Martin C. Cooper,et al. Soft Arc Consistency Applied to Optimal Planning , 2006, CP.
[32] Sharad Malik,et al. Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).
[33] Karem A. Sakallah,et al. GRASP—a new search algorithm for satisfiability , 1996, ICCAD 1996.
[34] Niklas Sörensson,et al. An Extensible SAT-solver , 2003, SAT.
[35] Javier Larrosa,et al. Node and arc consistency in weighted CSP , 2002, AAAI/IAAI.
[36] Teresa Alsinet,et al. Improved Exact Solvers for Weighted Max-SAT , 2005, SAT.
[37] Christian Bessiere,et al. Some Practicable Filtering Techniques for the Constraint Satisfaction Problem , 1997, IJCAI.
[38] Toby Walsh,et al. SAT v CSP , 2000, CP.
[39] Thomas Schiex,et al. On the Complexity of Compact Coalitional Games , 2009, IJCAI.
[40] Karem A. Sakallah,et al. Pueblo: A Hybrid Pseudo-Boolean SAT Solver , 2006, J. Satisf. Boolean Model. Comput..
[41] J. Freeman. Improvements to propositional satisfiability search algorithms , 1995 .
[42] Niklas Sörensson,et al. Translating Pseudo-Boolean Constraints into SAT , 2006, J. Satisf. Boolean Model. Comput..
[43] Javier Larrosa,et al. New Inference Rules for Efficient Max-SAT Solving , 2006, AAAI.
[44] Felip Manyà,et al. Detecting Disjoint Inconsistent Subformulas for Computing Lower Bounds for Max-SAT , 2006, AAAI.
[45] Amnon Meisels,et al. Conflict Directed Backjumping for Max-CSPs , 2007, IJCAI.
[46] Thomas Stützle,et al. Iterated Robust Tabu Search for MAX-SAT , 2003, Canadian Conference on AI.
[47] Sharad Malik,et al. On Solving the Partial MAX-SAT Problem , 2006, SAT.