Automatic Detection of At-Most-One and Exactly-One Relations for Improved SAT Encodings of Pseudo-Boolean Constraints

作者: Carlos Ansótegui , Miquel Bofill , Jordi Coll , Nguyen Dang , Juan Luis Esteban

DOI: 10.1007/978-3-030-30048-7_2

关键词:

摘要: Pseudo-Boolean (PB) constraints often have a critical role in constraint satisfaction and optimisation problems. Encoding PB to SAT has proven be an efficient approach many applications, however care must taken encode them compactly with good propagation properties. It been shown that at-most-one (AMO) exactly-one (EO) relations over subsets of the variables can exploited various encodings constraints, improving their compactness solving performance. In this paper we detect AMO EO completely automatically exploit improve are based on Multi-Valued Decision Diagrams (MDDs). Our experiments show substantial reductions encoding size dramatic improvements time thanks automatic detection.

参考文章(28)
Steffen Hölldobler, Norbert Manthey, Peter Steinke, A Compact Encoding of Pseudo-Boolean Constraints into SAT Lecture Notes in Computer Science. pp. 107- 118 ,(2012) , 10.1007/978-3-642-33347-7_10
Armin Biere, Daniel Le Berre, Emmanuel Lonca, Norbert Manthey, Detecting Cardinality Constraints in CNF theory and applications of satisfiability testing. pp. 285- 301 ,(2014) , 10.1007/978-3-319-09284-3_22
Hans Kellerer, Ulrich Pferschy, David Pisinger, Hans Kellerer, Ulrich Pferschy, David Pisinger, Multidimensional Knapsack Problems Knapsack Problems. pp. 235- 283 ,(2004) , 10.1007/978-3-540-24777-7_9
Miquel Bofill, Miquel Palahí, Josep Suy, Mateu Villaret, Solving Intensional Weighted CSPs by Incremental Optimization with BDDs principles and practice of constraint programming. pp. 207- 223 ,(2014) , 10.1007/978-3-319-10428-7_17
Saurabh Joshi, Ruben Martins, Vasco Manquinho, Generalized Totalizer encoding for pseudo-boolean constraints principles and practice of constraint programming. pp. 200- 209 ,(2015) , 10.1007/978-3-319-23219-5_15
Olivier Bailleux, Yacine Boufkhad, Olivier Roussel, New Encodings of Pseudo-Boolean Constraints into CNF theory and applications of satisfiability testing. pp. 181- 194 ,(2009) , 10.1007/978-3-642-02777-2_19
Sylvain Darras, Gilles Dequen, Laure Devendeville, Bertrand Mazure, Richard Ostrowski, Lakhdar Sais, Using Boolean Constraint Propagation for Sub-clauses Deduction Principles and Practice of Constraint Programming - CP 2005. pp. 757- 761 ,(2005) , 10.1007/11564751_59
Broos Maenhout, Mario Vanhoucke, NSPLib: a Nurse Scheduling Problem Library: a tool to evaluate (meta-)heuristic procedures 31st Annual conference of the European Working Group on Operational Research Applied to Health Services. pp. 151- 165 ,(2007)
Jinbo Huang, Universal Booleanization of Constraint Models principles and practice of constraint programming. pp. 144- 158 ,(2008) , 10.1007/978-3-540-85958-1_10
Chris Jefferson, Ian Miguel, Ian P. Gent, MINION: A Fast, Scalable, Constraint Solver european conference on artificial intelligence. pp. 98- 102 ,(2006)