Frontiers in Algorithmics

Algorithms for Queryable Uncertainty

[1]  Felip Manyà,et al.  Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers , 2005, CP.

[2]  Liu Yan.  Improving Lower Bounds in MAXSAT Complete Algorithm Based Optimizing Inconsistent Set , 2013 .

[3]  Maria Luisa Bonet,et al.  SAT-based MaxSAT algorithms , 2013, Artif. Intell..

[4]  Yuri Malitsky,et al.  MaxSAT by Improved Instance-Specific Algorithm Configuration , 2014, AAAI.

[5]  Maria Luisa Bonet,et al.  Resolution for Max-SAT , 2007, Artif. Intell..

[6]  Adrian Kügel,et al.  Improved Exact Solver for the Weighted MAX-SAT Problem , 2010, POS@SAT.

[7]  Fahiem Bacchus,et al.  Postponing Optimization to Speed Up MAXSAT Solving , 2013, CP.

[8]  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).

[9]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[10]  Serge Gaspers,et al.  A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between , 2009, J. Comput. Syst. Sci..

[11]  Djamal Habet,et al.  On the Resiliency of Unit Propagation to Max-Resolution , 2015, IJCAI.

[12]  Holger H. Hoos,et al.  UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT & MAX-SAT , 2004, SAT.

[13]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[14]  Venkatesh Raman,et al.  Upper Bounds for MaxSat: Further Improved , 1999, ISAAC.

[15]  Eugene C. Freuder,et al.  Anytime algorithms for constraint satisfaction and SAT problems , 1996, SGAR.

[16]  Felip Manyà,et al.  New Inference Rules for Max-SAT , 2007, J. Artif. Intell. Res..

[17]  Felip Manyà,et al.  Resolution-based lower bounds in MaxSAT , 2010, Constraints.

[18]  Rolf Niedermeier,et al.  New Upper Bounds for Maximum Satisfiability , 2000, J. Algorithms.

[19]  Han Hoogeveen,et al.  Short Shop Schedules , 1997, Oper. Res..

[20]  Felip Manyà,et al.  Exploiting Cycle Structures in Max-SAT , 2009, SAT.

[21]  Wei Wu,et al.  CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability , 2015, IEEE Transactions on Computers.

[22]  Hantao Zhang,et al.  Study of Lower Bound Functions for MAX-2-SAT , 2004, AAAI.