Algorithms for weighted boolean optimization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5584 LNCS, Issue , 2009, Pages 495-508

  Manquinho, Vasco ^a   Marques Silva, Joao ^b   Planes, Jordi ^c  

^a INSTITUTO SUPERIOR TÉCNICO   (Portugal)

^b UNIVERSITY COLLEGE DUBLIN   (Ireland)

^c UNIVERSITY OF LLEIDA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC;

BOOLEAN OPTIMIZATIONS; BOOLEAN SATISFIABILITY; MAX-SAT; MAXIMUM SATISFIABILITY; ORDERS OF MAGNITUDE; PSEUDO-BOOLEAN CONSTRAINTS; PSEUDO-BOOLEAN OPTIMIZATIONS; UNIFIED FRAMEWORK;

PROBLEM SOLVING;

EID: 70350685754     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02777-2_45     Document Type: Conference Paper

References (34)

1. Aloul, F., Ramani, A., Markov, I., Sakallah, K.A.: Generic ILP versus specialized 0-1 ILP: An update. In: International Conference on Computer-Aided Design, pp. 450-457 (2002)
2. Amgoud, L., Cayrol, C., Berre, D.L.: Comparing arguments using preference ordering for argument-based reasoning. In: International Conference on Tools with Artificial Intelligence, pp. 400-403 (1996)
3. Argelich, J., Li, C.M., Manà, F.: An improved exact solver for partial max-sat. In: International Conference on Nonconvex Programming: Local and Global Approaches, pp. 230-231 (2007)
4. Argelich, J., Li, C.M., Manyà, F., Planes, J.: Third Max-SAT evaluation (2008), http://www.maxsat.udl.cat/08/
5. Bailleux, O., Boufkhad, Y., Roussel, O.: A translation of pseudo Boolean constraints to SAT. Journal on Satisfiability, Boolean Modeling and Computation 2, 191-200 (2006)
6. Barth, P.: A Davis-Putnam Enumeration Algorithm for Linear Pseudo-Boolean Optimization. Technical Report MPI-I-95-2-003, Max Plank Institute for Computer Science (1995)
7. Berre, D.L.: SAT4J library, http://www.sat4j.org
8. Biere, A.: PicoSAT essentials. Journal on Satisfiability, Boolean Modeling and Computation 2, 75-97 (2008)
9. Bonet, M.L., Levy, J., Manyà, F.: Resolution for Max-SAT. Artificial Intelligence 171(8-9), 606-618 (2007)
10. Borchers, B., Furman, J.: A two-phase exact algorithm for MAX-SAT and weighted MAXSAT problems. Journal of Combinatorial Optimization 2, 299-306 (1999)
11. Chai, D., Kuehlmann, A.: A fast pseudo-Boolean constraint solver. In: Design Automation Conference, pp. 830-835 (2003)
12. Coudert, O.: On Solving Covering Problems. In: Design Automation Conference, pp. 197-202 (1996)
13. Darras, S., Dequen, G., Devendeville, L., Li, C.M.: On inconsistent clause-subsets for Max-SAT solving. In: Bessiére, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 225-240. Springer, Heidelberg (2007)
14. Edmonds, J.: Paths, trees and flowers. Canadian Journal of Mathematics 17, 449-467 (1965)
15. Een, N., Sörensson, N.: Translating pseudo-Boolean constraints into SAT. Journal on Satisfiability, Boolean Modeling and Computation 2, 1-26 (2006)
16. Fu, Z., Malik, S.: On solving the partial MAX-SAT problem. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 252-265. Springer, Heidelberg (2006)
17. Heras, F., Larrosa, J., Oliveras, A.: MiniMaxSat: a new weighted Max-SAT solver. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol. 4501, pp. 41-55. Springer, Heidelberg (2007)
18. Heras, F., Larrosa, J., Oliveras, A.: MiniMaxSAT: An efficient weighted Max-SAT solver. Journal of Artificial Intelligence Research 31, 1-32 (2008)
19. Larrosa, J., Heras, F., de Givry, S.: A logical approach to efficient Max-SAT solving. Artificial Intelligence 172(2-3), 204-233 (2008)
20. Li, C.M., Manyà, F., Planes, J.: New inference rules for Max-SAT. Journal of Artificial Intelligence Research 30, 321-359 (2007)
21. Liao, S., Devadas, S.: Solving Covering Problems Using LPR-Based Lower Bounds. In: Design Automation Conference, pp. 117-120 (1997)
22. Lin, H., Su, K.: Exploiting inference rules to compute lower bounds for MAX-SAT solving. In: International Joint Conference on Artificial Intelligence, pp. 2334-2339 (2007)
23. Manquinho, V., Marques-Silva, J.: Search pruning techniques in SAT-based branch-and-bound algorithms for the binate covering problem. IEEE Transactions on Computer-Aided Design 21(5), 505-516 (2002)
24. Manquinho, V., Marques-Silva, J.: Effective lower bounding techniques for pseudo-boolean optimization. In: Design, Automation and Test in Europe Conference, pp. 660-665 (2005)
25. Marques-Silva, J., Manquinho, V.: Towards more effective unsatisfiability-based maximum satisfiability algorithms. In: Kleine Büning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol. 4996, pp. 225-230. Springer, Heidelberg (2008)
26. Marques-Silva, J., Planes, J.: On using unsatisfiability for solving maximum satisfiability. Computing Research Repository, abs/0712.0097 (December 2007)
27. Marques-Silva, J., Planes, J.: Algorithms for maximum satisfiability using unsatisfiable cores. In: Design, Automation and Testing in Europe Conference, pp. 408-413 (2008)
28. Nieuwenhuis, R., Oliveras, A.: On SAT modulo theories and optimization problems. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 156-169. Springer, Heidelberg (2006)
29. Pipatsrisawat, K., Palyan, A., Chavira, M., Choi, A., Darwiche, A.: Solving weighted Max-SAT problems in a reduced search space: A performance analysis. Journal on Satisfiability Boolean Modeling and Computation (JSAT) 4, 191-217 (2008)
30. Ramírez, M., Geffner, H.: Structural relaxations by variable renaming and their compilation for solving MinCostSAT. In: Bessiére, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 605-619. Springer, Heidelberg (2007)
31. Safarpour, S., Mangassarian, H., Veneris, A., Liffiton, M.H., Sakallah, K.A.: Improved design debugging using maximum satisfiability. In: Formal Methods in Computer-Aided Design (2007)
32. Sheini, H., Sakallah, K.A.: Pueblo: A hybrid pseudo-Boolean SAT solver. Journal on Satisfiability, Boolean Modeling and Computation 2, 165-189 (2006)
33. Warners, J.: A linear-time transformation of linear inequalities into conjunctive normal form. Information Processing Letters 68(2), 63-69 (1998)
34. Xu, H., Rutenbar, R.A., Sakallah, K.A.: sub-SAT: a formulation for relaxed boolean satisfiability with applications in routing. IEEE Transactions on CAD of Integrated Circuits and Systems 22(6), 814-820 (2003)