Algorithms for Weighted Boolean Optimization

The Pseudo-Boolean Optimization (PBO) and Maximum Satisfiability (MaxSAT) problems are natural optimization extensions of Boolean Satisfiability (SAT). In the recent past, different algorithms have been proposed for PBO and for MaxSAT, despite the existence of straightforward mappings from PBO to MaxSAT, and vice-versa. This papers proposes Weighted Boolean Optimization (WBO), a new unified framework that aggregates and extends PBO and MaxSAT. In addition, the paper proposes a new unsatisfiability-based algorithm for WBO, based on recent unsatisfiability-based algorithms for MaxSAT. Besides standard MaxSAT, the new algorithm can also be used to solve weighted MaxSAT and PBO, handling pseudo-Boolean constraints either natively or by translation to clausal form. Experimental results illustrate that unsatisfiability-based algorithms for MaxSAT can be orders of magnitude more efficient than existing dedicated algorithms. Finally, the paper illustrates how other algorithms for either PBO or MaxSAT can be extended to WBO.

[1]  Armin Biere,et al.  PicoSAT Essentials , 2008, J. Satisf. Boolean Model. Comput..

[2]  Olivier Coudert,et al.  On solving covering problems , 1996, DAC '96.

[3]  Karem A. Sakallah,et al.  Pueblo: A Hybrid Pseudo-Boolean SAT Solver , 2006, J. Satisf. Boolean Model. Comput..

[4]  Albert Oliveras,et al.  MiniMaxSAT: An Efficient Weighted Max-SAT solver , 2008, J. Artif. Intell. Res..

[5]  Joao Marques-Silva,et al.  Algorithms for Maximum Satisfiability using Unsatisfiable Cores , 2008, 2008 Design, Automation and Test in Europe.

[6]  Niklas Sörensson,et al.  Translating Pseudo-Boolean Constraints into SAT , 2006, J. Satisf. Boolean Model. Comput..

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

[8]  Simon de Givry,et al.  A logical approach to efficient Max-SAT solving , 2006, Artif. Intell..

[9]  Joost P. Warners,et al.  A Linear-Time Transformation of Linear Inequalities into Conjunctive Normal Form , 1998, Inf. Process. Lett..

[10]  Kaile Su,et al.  Exploiting Inference Rules to Compute Lower Bounds for MAX-SAT Solving , 2007, IJCAI.

[11]  Olivier Roussel,et al.  A Translation of Pseudo Boolean Constraints to SAT , 2006, J. Satisf. Boolean Model. Comput..

[12]  Brian Borchers,et al.  A Two-Phase Exact Algorithm for MAX-SAT and Weighted MAX-SAT Problems , 1998, J. Comb. Optim..

[13]  Albert Oliveras,et al.  MiniMaxSat: A New Weighted Max-SAT Solver , 2007, SAT.

[14]  Vasco M. Manquinho,et al.  Search pruning techniques in SAT-based branch-and-bound algorithmsfor the binate covering problem , 2002, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[15]  Srinivas Devadas,et al.  Solving Covering Problems Using LPR-based Lower Bounds , 1997, Proceedings of the 34th Design Automation Conference.

[16]  Andreas Kuehlmann,et al.  A fast pseudo-Boolean constraint solver , 2003, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[17]  Vasco M. Manquinho,et al.  Effective lower bounding techniques for pseudo-Boolean optimization [EDA applications] , 2005, Design, Automation and Test in Europe.

[18]  Claudette Cayrol,et al.  Comparing arguments using preference orderings for argument-based reasoning , 1996, Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence.

[19]  Sean Safarpour,et al.  Improved Design Debugging Using Maximum Satisfiability , 2007 .

[20]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[21]  Joao Marques-Silva,et al.  On Using Unsatisfiability for Solving Maximum Satisfiability , 2007, ArXiv.

[22]  Adnan Darwiche,et al.  Solving Weighted Max-SAT Problems in a Reduced Search Space: A Performance Analysis , 2008, J. Satisf. Boolean Model. Comput..

[23]  Sharad Malik,et al.  On Solving the Partial MAX-SAT Problem , 2006, SAT.

[24]  Gilles Dequen,et al.  On Inconsistent Clause-Subsets for Max-SAT Solving , 2007, CP.

[25]  Vasco M. Manquinho,et al.  Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms , 2008, SAT.

[26]  Sean Safarpour,et al.  Improved Design Debugging Using Maximum Satisfiability , 2007, Formal Methods in Computer Aided Design (FMCAD'07).

[27]  P. Barth.  A Davis-Putnam based enumeration algorithm for linear pseudo-Boolean optimization , 1995 .

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

[29]  Albert Oliveras,et al.  On SAT Modulo Theories and Optimization Problems , 2006, SAT.

[30]  Hector Geffner,et al.  Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT , 2007, CP.

[31]  K. Sakallah,et al.  Generic ILP versus specialized 0-1 ILP: an update , 2002, ICCAD 2002.