On Inconsistent Clause-Subsets for Max-SAT Solving
暂无分享,去创建一个
Gilles Dequen | Chu Min Li | Chu Min Li | Sylvain Darras | Laure Devendeville | Gilles Dequen | L. Devendeville | S. Darras
[1] Felip Manyà,et al. Detecting Disjoint Inconsistent Subformulas for Computing Lower Bounds for Max-SAT , 2006, AAAI.
[2] Manfred Meyer. Constraint Processing, Selected Papers , 1995 .
[3] Reiner Hähnle,et al. A modular reduction of regular logic to classical logic , 2001, Proceedings 31st IEEE International Symposium on Multiple-Valued Logic.
[4] Francesca Rossi,et al. Principles and Practice of Constraint Programming – CP 2003 , 2003, Lecture Notes in Computer Science.
[5] Thomas Schiex,et al. On the Complexity of Compact Coalitional Games , 2009, IJCAI.
[6] Teresa Alsinet,et al. Improved Exact Solvers for Weighted Max-SAT , 2005, SAT.
[7] Jean-Paul Watson,et al. Toward an Understanding of Local Search Cost in Job-Shop Scheduling , 2001 .
[8] Mark Wallace,et al. Principles and Practice of Constraint Programming – CP 2004 , 2004, Lecture Notes in Computer Science.
[9] Felip Manyà,et al. New Inference Rules for Max-SAT , 2007, J. Artif. Intell. Res..
[10] Carlos Ansótegui,et al. Mapping Problems with Finite-Domain Variables into Problems with Boolean Variables , 2004, SAT.
[11] Frank Pfenning,et al. Logic Programming and Automated Reasoning , 1994, Lecture Notes in Computer Science.
[12] Eugene C. Freuder,et al. Comparative studies of constraint satisfaction and Davis-Putnam algorithms for maximum satisfiability problems , 1993, Cliques, Coloring, and Satisfiability.
[13] Simon de Givry,et al. Solving Max-SAT as Weighted CSP , 2003, CP.
[14] Kaile Su,et al. Exploiting Inference Rules to Compute Lower Bounds for MAX-SAT Solving , 2007, IJCAI.
[15] Ramón Béjar,et al. Solving Combinatorial Problems with Regular Local Search Algorithms , 1999, LPAR.
[16] Felip Manyà,et al. Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers , 2005, CP.
[17] Josep Argelich,et al. Exact Max-SAT solvers for over-constrained problems , 2006, J. Heuristics.
[18] Thomas Schiex,et al. Maintaining Reversible DAC for Max-CSP , 1999, Artif. Intell..
[19] Weixiong Zhang,et al. MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability , 2005, Artif. Intell..
[20] Yahiko Kambayashi,et al. New Bounds for Oblivious Mesh Routing , 1998, ESA.
[21] Richard J. Wallace,et al. Directed Arc Consistency Preprocessing , 1995, Constraint Processing, Selected Papers.
[22] Xiang Ji,et al. Towards Inferring Protein Interactions: Challenges and Solutions , 2006, EURASIP J. Adv. Signal Process..
[23] Javier Larrosa,et al. New Inference Rules for Efficient Max-SAT Solving , 2006, AAAI.
[24] Hantao Zhang,et al. Study of Lower Bound Functions for MAX-2-SAT , 2004, AAAI.
[25] 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.