Parallel search for maximum satisfiability

AI Communications

Volumn 25, Issue 2, 2012, Pages 75-95

  Martins, Ruben ^a   Manquinho, Vasco ^a   Lynce, Inês ^a  

^a INESC ID   (Portugal)

Author keywords

cardinality constraints; maximum satisfiability; Parallel search

Indexed keywords

BOOLEAN SATISFIABILITY; CARDINALITY CONSTRAINTS; ENCODINGS; LINEAR SEARCH; LOWER AND UPPER BOUNDS; LOWER BOUNDS; MAX-SAT; MAXIMUM SATISFIABILITY; MULTI-CORE PROCESSOR; NUMBER OF THREADS; OPTIMAL SOLUTIONS; PARALLEL SEARCH; PARALLEL SEARCH ALGORITHM; PARALLEL SOLVER; SAT SOLVERS; SEARCH SPACES; UPPER BOUND;

ALGORITHMS; BOOLEAN FUNCTIONS;

OPTIMAL SYSTEMS;

EID: 84864428731     PISSN: 09217126     EISSN: None     Source Type: Journal    
DOI: 10.3233/AIC-2012-0517     Document Type: Conference Paper

References (39)

1. X. An, M. Koshimura, H. Fujita and R. Hasegawa, QMaxSAT version 0.3 and 0.4, in: Proc. International Workshop on First- Order Theorem Proving, Bern, Switzerland, 2011.
2. C. Ansótegui, M. Bonet and J. Levy, Solving (weighted) partial MaxSAT through satisfiability testing, in: Proc. International Conference on Theory and Applications of Satisfiability Testing, Springer-Verlag, Berlin, 2009, pp. 427-440.
3. C. Ansótegui and F. Manyá, Mapping problems with finitedomain variables into problems with Boolean variables, in: Proc. International Conference on Theory and Applications of Satisfiability Testing, Springer-Verlag, Berlin, 2004, pp. 1-15.
4. J. Argelich, C.M. Li and F. Manyá, An improved exact solver for partial max-sat, in: Proc. International Conference on Nonconvex Programming: Local and Global Approaches, Rouen, France, 2007, pp. 230-231.
5. R. Asín, R. Nieuwenhuis, A. Oliveras and E. Rodríguez- Carbonell, Practical algorithms for unsatisfiability proof and core generation in SAT solvers, AI Commun. 23(2,3) (2010), 145-157.
6. R. Asín, R. Nieuwenhuis, A. Oliveras and E. Rodríguez- Carbonell, Cardinality networks: a theoretical and empirical study, Constraints 16(2) (2011), 195-221.
7. G. Audemard and L. Simon, Predicting learnt clauses quality in modern SAT solvers, in: Proc. International Joint Conference on Artificial Intelligence, IJCAI/AAAI, Pasadena, CA, 2009, pp. 399-404.
8. O. Bailleux and Y. Boufkhad, Efficient CNF encoding of Boolean cardinality constraints, in: Proc. International Conference on Principles and Practice of Constraint Programming, Springer-Verlag, Berlin, 2003, pp. 108-122.
9. A. Biere, Lingeling, plingeling, PicoSAT and PrecoSAT at SAT race 2010, FMV Report Series, Technical Report 10/1, Johannes Kepler University, Linz, 2010.
10. M.L. Bonet, J. Levy and F. Manyá, Resolution for Max-SAT, Artif. Intell. 171(8,9) (2007), 606-618. (Pubitemid 46828977)
11. M. Büttner and J. Rintanen, Satisfiability planning with constraints on the number of actions, in: Proc. International Conference on Automated Planning and Scheduling, Monterey, CA, 2005, pp. 292-299.
12. J. Chen, A new SAT encoding of the at-most-one constraint, in: Proc. International Workshop on Modelling and Reformulating Constraint Satisfaction Problems, St Andrews, Scotland, 2010.
13. M. Codish and M. Zazon-Ivry, Pairwise cardinality networks, in: Proc. International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, Springer-Verlag, Berlin, 2010, pp. 154-172.
14. S. Darras, G. Dequen, L. Devendevill and C.M. Li, On inconsistent clause-subsets for Max-SAT solving, in: Proc. International Conference on Principles and Practice of Constraint Programming, 2007, pp. 225-240.
15. N. Eén and N. Sörensson, Translating pseudo-Boolean constraints into SAT, J. Satisfiabil. Boolean Model. Comput. 2 (2006), 1-26.
16. A.M. Frisch and P.A. Giannaros, SAT encodings for the atmost- k constraint, in: Proc. International Workshop on Modelling and Reformulating Constraint Satisfaction Problems, St Andrews, Scotland, 2010.
17. 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, J. Automat. Reason. 35(1-3) (2005), 143-179. (Pubitemid 44619283)
18. Z. Fu and S. Malik, On solving the partial Max-SAT problem, in: Proc. International Conference on Theory and Applications of Satisfiability Testing, Springer-Verlag, Berlin, 2006, pp. 252-265. (Pubitemid 44531761)
19. I.P. Gent and P. Nightingale, A new encoding of all different into SAT, in: Proc. International Workshop on Modelling and Reformulating Constraint Satisfaction Problems, Toronto, Canada, 2004.
20. L. Guo, Y. Hamadi, S. Jabbour and L. Sais, Diversification and intensification in parallel SAT solving, in: Principles and Practice of Constraint Programming, Springer-Verlag, Berlin, 2010, pp. 252-265.
21. Y. Hamadi, S. Jabbour and L. Sais, ManySAT: a parallel SAT solver, J. Satisfiabil. Boolean Model. Comput. 6 (2009), 245-262.
22. Y. Hamadi, S. Jabbour and L. Sais, Control-based clause sharing in parallel SAT solving, in: Proc. International Joint Conference on Artificial Intelligence, IJCAI/AAAI, Pasadena, CA, 2009, pp. 499-504.
23. W. Klieber and G. Kwon, Efficient CNF encoding for selecting 1 from N objects, in: Proc. International Workshop on Constraints in Formal Verification, Bremen, Germany, 2007.
24. S. Kottler and M. Kaufmann, SArTagnan -A parallel portfolio SAT solver with lockless physical clause sharing, in: Pragmatics of SAT Workshop, Ann Arbor, MI, 2011.
25. D. Le Berre and A. Parrain, The Sat4j library, release 2.2 system description, J. Satisfiabil. Boolean Model. Comput. 7 (2010), 59-64.
26. C.M. Li, F. Manyá and J. Planes, New inference rules for Max- SAT, J. Artif. Intell. Res. 30 (2007), 321-359.
27. H. Lin and K. Su, Exploiting inference rules to compute lower bounds for Max-SAT solving, in: Proc. International Joint Conference on Artificial Intelligence, IJCAI/AAAI, Pasadena, CA, 2007, pp. 2334-2339.
28. V. Manquinho, J. Marques-Silva and J. Planes, Algorithms for weighted Boolean optimization, in: Proc. International Conference on Theory and Applications of Satisfiability Testing, Springer-Verlag, Berlin, 2009, pp. 495-508.
29. V. Manquinho, R. Martins and I. Lynce, Improving unsatisfiability-based algorithms for Boolean optimization, in: Proc. International Conference on Theory and Applications of Satisfiability Testing, Springer-Verlag, Berlin, 2010, pp. 181-193.
30. J. Marques-Silva and I. Lynce, Towards robust CNF encodings of cardinality constraints, in: Proc. International Conference on Principles and Practice of Constraint Programming, Springer-Verlag, Berlin, 2007, pp. 483-497.
31. J. Marques-Silva and V. Manquinho, Towards more effective unsatisfiability-based maximum satisfiability algorithms, in: Proc. International Conference on Theory and Applications of Satisfiability Testing, Springer-Verlag, Berlin, 2008, pp. 225-230. (Pubitemid 351775513)
32. J. Marques-Silva and J. Planes, Algorithms for maximum satisfiability using unsatisfiable cores, in: Design, Automation and Testing in Europe Conference, ACM Press, New York, NY, 2008, pp. 408-413.
33. J. Marques-Silva and K. Sakallah, GRASP: a new search algorithm for satisfiability, in: Proc. International Conference on Computer-Aided Design, IEEE Computer Society Press, Washington, DC, 1996, pp. 220-227.
34. R. Martins, V. Manquinho and I. Lynce, Exploiting cardinality encodings in parallel maximum satisfiability, in: Proc. International Conference on Tools with Artificial Intelligence, IEEE Computer Society Press, Washington, DC, 2011, pp. 313-320.
35. R. Martins, V. Manquinho and I. Lynce, Parallel search for Boolean optimization, in: Proc. RCRA International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, Barcelona, Spain, 2011.
36. S. Prestwich, Variable dependency in local search: prevention is better than cure, in: Proc. International Conference on Theory and Applications of Satisfiability Testing, Springer-Verlag, Berlin, 2007, pp. 107-120.
37. C. Sinz, Towards an optimal CNF encoding of Boolean cardinality constraints, in: Proc. International Conference on Principles and Practice of Constraint Programming, Springer- Verlag, Berlin, 2005, pp. 827-831.
38. L. Zhang, C.F. Madigan, M.W. Moskewicz and S. Malik, Efficient conflict driven learning in Boolean satisfiability solver, in: Proc. International Conference on Computer-Aided Design, IEEE Press, Piscataway, NJ, 2001, pp. 279-285. (Pubitemid 33148971)
39. L. Zhang and S. Malik, Validating SAT solvers using an independent resolution-based checker: practical implementations and other applications, in: Design, Automation and Testing in Europe Conference, IEEE Computer Society Press, Washington, DC, 2003, pp. 10880-10885.