Exploiting cardinality encodings in parallel maximum satisfiability

Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI

Volumn , Issue , 2011, Pages 313-320

  Martins, Ruben ^a   Manquinho, Vasco ^a   Lynce, Ines ^a  

^a INESC ID   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

CARDINALITIES; CARDINALITY CONSTRAINTS; ENCODINGS; LOWER AND UPPER BOUNDS; MAX-SAT; MAXIMUM SATISFIABILITY; OPTIMUM VALUE; PARALLEL SOLVER; PRACTICAL PROBLEMS;

ENCODING (SYMBOLS); FORMAL LOGIC;

PROBLEM SOLVING;

EID: 84855756978     PISSN: 10823409     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICTAI.2011.54     Document Type: Conference Paper

References (25)

1. C. Ansótegui, M. Bonet, and J. Levy, "Solving (Weighted) Partial MaxSAT through Satisfiability Testing," in International Conference on Theory and Applications of Satisfiability Testing, 2009, pp. 427-440.
2. C. Ansótegui and F. Manyà, "Mapping problems with finite-domain variables into problems with boolean variables," in International Conference on Theory and Applications of Satisfiability Testing, 2004, pp. 1-15.
3. R. Asín, R. Nieuwenhuis, A. Oliveras, and E. Rodríguez- Carbonell, "Cardinality Networks: a theoretical and empirical study," Constraints, vol. 16, no. 2, pp. 195-221, 2011.
4. G. Audemard and L. Simon, "Predicting Learnt Clauses Quality in Modern SAT Solvers," in International Joint Conference on Artificial Intelligence, 2009, pp. 399-404.
5. O. Bailleux and Y. Boufkhad, "Efficient CNF Encoding of Boolean Cardinality Constraints," in International Conference on Principles and Practice of Constraint Programming, 2003, pp. 108-122.
6. A. Biere, "Lingeling, Plingeling, PicoSAT and PrecoSAT at SAT Race 2010," SAT Race, Solver Description, 2010.
7. M. Büttner and J. Rintanen, "Satisfiability Planning with Constraints on the Number of Actions," in International Conference on Automated Planning and Scheduling, 2005, pp. 292-299.
8. J. Chen, "A New SAT Encoding of the At-Most-One Constraint," in International Workshop on Modelling and Reformulating Constraint Satisfaction Problems, 2010.
9. M. Codish and M. Zazon-Ivry, "Pairwise Cardinality Networks," in International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, 2010, pp. 154-172.
10. N. Eén and N. Sörensson, "Translating pseudo-Boolean Constraints into SAT," Journal on Satisfiability, Boolean Modeling and Computation, vol. 2, pp. 1-26, 2006.
11. A. M. Frisch and P. A. Giannaros, "SAT Encodings for the At-Most-k Constraint," in International Workshop on Modelling and Reformulating Constraint Satisfaction Problems, 2010.
12. A. M. Frisch, T. J. Peugniez, A. J. Doggett, and P. Nightingale, "Solving Non-Boolean Satisfiability Problems with Stochastic Local Search: A Comparison of Encodings," Journal of Automated Reasoning, vol. 35, no. 1-3, pp. 143-179, 2005. (Pubitemid 44619283)
13. Z. Fu and S. Malik, "On solving the partial MAX-SAT problem," in International Conference on Theory and Applications of Satisfiability Testing, 2006, pp. 252-265. (Pubitemid 44531761)
14. I. P. Gent and P. Nightingale, "A new encoding of All Different into SAT," in International Workshop on Modelling and Reformulating Constraint Satisfaction Problems, 2004.
15. Y. Hamadi, S. Jabbour, and L. Sais, "Control-Based Clause Sharing in Parallel SAT Solving," in International Joint Conference on Artificial Intelligence, 2009, pp. 499-504.
16. -, "ManySAT: a Parallel SAT Solver," Journal on Satisfiability, Boolean Modeling and Computation, vol. 6, pp. 245-262, 2009.
17. W. Klieber and G. Kwon, "Efficient CNF Encoding for Selecting 1 from N Objects," in International Workshop on Constraints in Formal Verification, 2007.
18. D. Le Berre and A. Parrain, "The Sat4j library, release 2.2 system description," Journal on Satisfiability Boolean Modeling and Computation, vol. 7, pp. 59-64, 2010.
19. V. Manquinho, J. Marques-Silva, and J. Planes, "Algorithms for Weighted Boolean Optimization," in International Conference on Theory and Applications of Satisfiability Testing, 2009, pp. 495-508.
20. V. Manquinho, R. Martins, and I. Lynce, "Improving Unsatisfiability-Based Algorithms for Boolean Optimization," in International Conference on Theory and Applications of Satisfiability Testing, 2010, pp. 181-193.
21. J. Marques-Silva and K. Sakallah, "GRASP: A new search algorithm for satisfiability," in International Conference on Computer-Aided Design, 1996, pp. 220-227.
22. R. Martins, V. Manquinho, and I. Lynce, "Parallel Algorithms for Boolean Optimization," in RCRA International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, 2011.
23. S. Prestwich, "Variable dependency in local search: prevention is better than cure," in International Conference on Theory and Applications of Satisfiability Testing, 2007, pp. 107-120.
24. C. Sinz, "Towards an Optimal CNF Encoding of Boolean Cardinality Constraints," in International Conference on Principles and Practice of Constraint Programming, 2005, pp. 827-831.
25. L. Zhang, C. F. Madigan, M. W. Moskewicz, and S. Malik, "Efficient conflict driven learning in boolean satisfiability solver," in International Conference on Computer-Aided Design, 2001, pp. 279-285. (Pubitemid 33148971)