Within-problem Learning for Efficient Lower Bound Computation in Max-SAT Solving
暂无分享,去创建一个
[1] Josep Argelich,et al. Partial Max-SAT Solvers with Clause Learning , 2007, SAT.
[2] Javier Larrosa,et al. New Inference Rules for Efficient Max-SAT Solving , 2006, AAAI.
[3] 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).
[4] Sean Safarpour,et al. Improved Design Debugging Using Maximum Satisfiability , 2007 .
[5] Weixiong Zhang,et al. MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability , 2005, Artif. Intell..
[6] Gilles Dequen,et al. On Inconsistent Clause-Subsets for Max-SAT Solving , 2007, CP.
[7] Inês Lynce,et al. A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas , 2005, SAT.
[8] Kaile Su,et al. Exploiting Inference Rules to Compute Lower Bounds for MAX-SAT Solving , 2007, IJCAI.
[9] Felip Manyà,et al. Detecting Disjoint Inconsistent Subformulas for Computing Lower Bounds for Max-SAT , 2006, AAAI.
[10] Adnan Darwiche,et al. Clone: Solving Weighted Max-SAT in a Reduced Search Space , 2007, Australian Conference on Artificial Intelligence.
[11] Qiang Yang,et al. Learning action models from plan examples using weighted MAX-SAT , 2007, Artif. Intell..
[12] Simon de Givry,et al. A logical approach to efficient Max-SAT solving , 2006, Artif. Intell..
[13] Xiang Ji,et al. Towards Inferring Protein Interactions: Challenges and Solutions , 2006, EURASIP J. Adv. Signal Process..
[14] Felip Manyà,et al. New Inference Rules for Max-SAT , 2007, J. Artif. Intell. Res..
[15] Felip Manyà,et al. Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers , 2005, CP.
[16] Albert Oliveras,et al. MiniMaxSAT: An Efficient Weighted Max-SAT solver , 2008, J. Artif. Intell. Res..
[17] Maria Luisa Bonet,et al. Resolution for Max-SAT , 2007, Artif. Intell..