================================================================================ pwbo is a parallel Boolean optimization solver. For the MaxSAT'13 evaluation pwbo is run with two threads. An unsatisfiability-based algorithm is used to search on the lower bound of the optimal solution, while at the same time a linear search is performed on the upper bound of the optimal solution. The latest version of pwbo can be downloaded at: http://sat.inesc-id.pt/pwbo/ If you use pwbo in your work please cite the following paper: [2] R. Martins, V. Manquinho, I. Lynce: Parallel Search for Maximum Satisfiability. AI Communications 25(2): 75-95 (2012) ================================================================================ References: [1] R. Martins, V. Manquinho, I. Lynce: Clause Sharing in Deterministic Parallel Maximum Satisfiability. RCRA 2012 [2] R. Martins, V. Manquinho, I. Lynce: Parallel Search for Maximum Satisfiability. AI Communications 25(2): 75-95 (2012) [3] R. Martins, V. Manquinho, I. Lynce: Clause Sharing in Parallel MaxSAT LION 2012: 455-460 [4] R. Martins, V. Manquinho, I. Lynce: Exploiting Cardinality Encodings in Parallel Maximum Satisfiability. ICTAI 2011: 313-320 [5] R. Martins, V. Manquinho, I. Lynce: Parallel Search for Boolean Optimization. RCRA 2011 [6] V. Manquinho, R. Martins, I. Lynce: Improving Unsatisfiability-Based Algorithms for Boolean Optimization. SAT 2010: 181-193 [7] V. Manquinho, J. Marques-Silva, J. Planes: Algorithms for Weighted Boolean Optimization. SAT 2009: 495-508 ================================================================================ Contributors: Ruben Martins, Vasco Manquinho, InĂªs Lynce To contact the authors please send an email to pwbo@sat.inesc-id.pt ================================================================================