暂无分享,去创建一个
[1] Patric R. J. Östergård,et al. A fast algorithm for the maximum clique problem , 2002, Discret. Appl. Math..
[2] Stefan Arnborg,et al. Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey , 1985, BIT.
[3] David R. Wood,et al. An algorithm for finding a maximum clique in a graph , 1997, Oper. Res. Lett..
[4] Nils J. Nilsson,et al. Artificial Intelligence , 1974, IFIP Congress.
[5] Jean-Charles Régin,et al. Using Constraint Programming to Solve the Maximum Clique Problem , 2003, CP.
[6] Thomas Schiex,et al. Solving weighted CSP by maintaining arc consistency , 2004, Artif. Intell..
[7] Donald W. Loveland,et al. A machine program for theorem-proving , 2011, CACM.
[8] Toby Walsh,et al. Adding resolution to the DPLL procedure for Boolean satisfiability , 2002 .
[9] P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .
[10] Thomas Schiex,et al. Soft Constraints , 2000, WLP.
[11] Allen Van Gelder,et al. Satisfiability testing with more reasoning and less guessing , 1995, Cliques, Coloring, and Satisfiability.
[12] Byungki Cha,et al. Adding New Clauses for Faster Local Search , 1996, AAAI/IAAI, Vol. 1.
[13] Felip Manyà,et al. Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers , 2005, CP.
[14] Roman Barták,et al. Constraint Processing , 2009, Encyclopedia of Artificial Intelligence.
[15] Niklas Sörensson,et al. An Extensible SAT-solver , 2003, SAT.
[16] Umberto Bertelè,et al. Nonserial Dynamic Programming , 1972 .
[17] James D. Park. Using weighted MAX-SAT engines to solve MPE , 2002, AAAI/IAAI.
[18] Javier Larrosa,et al. Boosting Search with Variable Elimination in Constraint Optimization and Constraint Satisfaction Problems , 2003, Constraints.
[19] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[20] Simon de Givry,et al. Existential arc consistency: Getting closer to full arc consistency in weighted CSPs , 2005, IJCAI.
[21] Rina Dechter,et al. Resolution versus Search: Two Strategies for SAT , 2000, Journal of Automated Reasoning.
[22] Christian Bessiere,et al. Arc-Consistency and Arc-Consistency Again , 1993, Artif. Intell..
[23] Javier Larrosa,et al. New Inference Rules for Efficient Max-SAT Solving , 2006, AAAI.
[24] Fahiem Bacchus,et al. Enhancing Davis Putnam with extended binary clause reasoning , 2002, AAAI/IAAI.
[25] Albert Oliveras,et al. On SAT Modulo Theories and Optimization Problems , 2006, SAT.
[26] Jianer Chen,et al. Improved exact algorithms for MAX-SAT , 2002, Discret. Appl. Math..
[27] Torsten Fahle,et al. Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique , 2002, ESA.
[28] Joel Sokol,et al. Optimal Protein Structure Alignment Using Maximum Cliques , 2005, Oper. Res..
[29] Toby Walsh,et al. Handbook of Constraint Programming , 2006, Handbook of Constraint Programming.
[30] Tuomas Sandholm,et al. Algorithm for optimal winner determination in combinatorial auctions , 2002, Artif. Intell..
[31] Venkatesh Raman,et al. Upper Bounds for MaxSat: Further Improved , 1999, ISAAC.
[32] Felip Manyà,et al. Detecting Disjoint Inconsistent Subformulas for Computing Lower Bounds for Max-SAT , 2006, AAAI.
[33] Hilary Putnam,et al. A Computing Procedure for Quantification Theory , 1960, JACM.
[34] M. Trick,et al. Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993 , 1996 .
[35] Weixiong Zhang,et al. MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability , 2005, Artif. Intell..
[36] Tuomas Sandholm,et al. An algorithm for optimal winner determination in combinatorial auctions , 1999, IJCAI 1999.
[37] Rina Dechter,et al. Bucket Elimination: A Unifying Framework for Reasoning , 1999, Artif. Intell..
[38] Martin C. Cooper. High-Order Consistency in Valued Constraint Satisfaction , 2005, Constraints.
[39] Simon de Givry,et al. Solving Max-SAT as Weighted CSP , 2003, CP.
[40] Felip Manyà,et al. New Inference Rules for Max-SAT , 2007, J. Artif. Intell. Res..
[41] Martin C. Cooper. Reduction operations in fuzzy or valued constraint satisfaction , 2003, Fuzzy Sets Syst..
[42] Yoav Shoham,et al. Towards a universal test suite for combinatorial auction algorithms , 2000, EC '00.
[43] Jin-Kao Hao,et al. A “Logic-Constrained” Knapsack Formulation and a Tabu Algorithm for the Daily Photograph Scheduling of an Earth Observation Satellite , 2001, Comput. Optim. Appl..
[44] Javier Larrosa,et al. Resolution in Max-SAT and its relation to local consistency in weighted CSPs , 2005, IJCAI.
[45] Chu Min Li,et al. Heuristics Based on Unit Propagation for Satisfiability Problems , 1997, IJCAI.
[46] Thomas Schiex,et al. On the Complexity of Compact Coalitional Games , 2009, IJCAI.
[47] Karem A. Sakallah,et al. Pueblo: A Hybrid Pseudo-Boolean SAT Solver , 2006, J. Satisf. Boolean Model. Comput..
[48] Niklas Sörensson,et al. Translating Pseudo-Boolean Constraints into SAT , 2006, J. Satisf. Boolean Model. Comput..
[49] Javier Larrosa,et al. Node and arc consistency in weighted CSP , 2002, AAAI/IAAI.
[50] Teresa Alsinet,et al. Improved Exact Solvers for Weighted Max-SAT , 2005, SAT.
[51] Martin C. Cooper,et al. Arc consistency for soft constraints , 2004, Artif. Intell..
[52] David S. Johnson,et al. Cliques, Coloring, and Satisfiability , 1996 .
[53] Eugene C. Freuder,et al. Neighborhood Inverse Consistency Preprocessing , 1996, AAAI/IAAI, Vol. 1.
[54] Javier Larrosa,et al. On the Practical use of Variable Elimination in Constraint Optimization Problems: 'Still-life' as a Case Study , 2005, J. Artif. Intell. Res..
[55] Rolf Niedermeier,et al. New Upper Bounds for Maximum Satisfiability , 2000, J. Algorithms.
[56] Maria Luisa Bonet,et al. A Complete Calculus for Max-SAT , 2006, SAT.
[57] Teresa Alsinet,et al. Improved branch and bound algorithms for Max-SAT , 2003 .