Core-Guided MaxSAT with Soft Cardinality Constraints

[1]  Felip Manyà,et al.  MaxSAT, Hard and Soft Constraints , 2021, Handbook of Satisfiability.

[2]  Joao Marques-Silva,et al.  Iterative and core-guided MaxSAT solving: A survey and assessment , 2013, Constraints.

[3]  Maria Luisa Bonet,et al.  Improving WPM2 for (Weighted) Partial MaxSAT , 2013, CP.

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

[5]  Miyuki Koshimura,et al.  QMaxSAT: A Partial Max-SAT Solver , 2012, J. Satisf. Boolean Model. Comput..

[6]  Joao Marques-Silva,et al.  Improvements to Core-Guided Binary Search for MaxSAT , 2012, SAT.

[7]  Fahiem Bacchus,et al.  Solving MAXSAT by Solving a Sequence of Simpler SAT Instances , 2011, CP.

[8]  Emmanuel Hebrard,et al.  Models and Strategies for Variants of the Job Shop Scheduling Problem , 2011, CP.

[9]  Martin Gebser,et al.  aspcud: A Linux Package Configuration Tool Based on Answer Set Programming , 2011, LoCoCo.

[10]  Josep Argelich,et al.  Boolean lexicographic optimization: algorithms & applications , 2011, Annals of Mathematics and Artificial Intelligence.

[11]  Rupak Majumdar,et al.  Cause clue clauses: error localization using maximum satisfiability , 2010, PLDI '11.

[12]  Maria Luisa Bonet,et al.  Solving (Weighted) Partial MaxSAT through Satisfiability Testing , 2009, SAT.

[13]  Vasco M. Manquinho,et al.  Algorithms for Weighted Boolean Optimization , 2009, SAT.

[14]  Josep Argelich,et al.  The First and Second Max-SAT Evaluations , 2008, J. Satisf. Boolean Model. Comput..

[15]  Armin Biere,et al.  Lemmas on demand for the extensional theory of arrays , 2008, SMT '08/BPR '08.

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

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

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

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

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

[21]  Carsten Sinz,et al.  Towards an Optimal CNF Encoding of Boolean Cardinality Constraints , 2005, CP.

[22]  Olivier Bailleux,et al.  Efficient CNF Encoding of Boolean Cardinality Constraints , 2003, CP.

[23]  Alessandro Cimatti,et al.  Theory and Applications of Satisfiability Testing – SAT 2012 , 2012, Lecture Notes in Computer Science.

[24]  Torsten Schaub,et al.  Unsatisfiability-based optimization in clasp , 2012, ICLP.

[25]  Oliver Kullmann,et al.  Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings , 2009, SAT.

[26]  C. Gomes,et al.  Theory and Applications of Satisfiability Testing - SAT 2006, 9th International Conference, Seattle, WA, USA, August 12-15, 2006, Proceedings , 2006, SAT.

[27]  Peter van Beek.  Principles and Practice of Constraint Programming - CP 2005, 11th International Conference, CP 2005, Sitges, Spain, October 1-5, 2005, Proceedings , 2005, CP.

[28]  F. Rossi.  Principles and Practice of Constraint Programming – CP 2003 , 2003, Lecture Notes in Computer Science.