Pseudo-boolean and cardinality constraints

Frontiers in Artificial Intelligence and Applications

Volumn 185, Issue 1, 2009, Pages 695-733

  Roussel, Olivier ^a   Manquinho, Vasco ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

0-1 PROGRAMMING; CARDINALITY CONSTRAINTS; EXPRESSIVE POWER; LITERALS; NATURAL GENERALIZATION; OPTIMIZATION PROBLEMS; PSEUDO-BOOLEAN; PSEUDO-BOOLEAN CONSTRAINTS; SATISFIABILITY PROBLEMS; WEIGHTED SUM;

FORMAL LOGIC;

EID: 72949099290     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: 10.3233/978-1-58603-929-5-695     Document Type: Article

References (55)

1. R. Ahuja, T. Magnanti, and J. Orlin. Network Flows: Theory, Algorithms, and Applications. Pearson Education, 1993.
2. P. Barth. A Davis-Putnam Enumeration Algorithm for Linear Pseudo-Boolean Optimization. Technical Report MPI-I-95-2-003, Max Plank Institute for Computer Science, 1995.
3. P. Barth. Logic-Based 0-1 Constraint Programming. Kluwer Academic Publishers, 1995.
4. O. Bailleux and Y. Boufkhad. Efficient CNF Encoding of Boolean Cardinality Constraints. In Proceedings of the 9th International Conference on Principles and Practice of Constraint Programming, CP 2003, volume 2833 of LNCS, pages 108-122, September 2003.
5. O. Bailleux, Y. Boufkhad, and O. Roussel. A Translation of Pseudo Boolean Constraints to SAT. Journal on Satisfiability, Boolean Modeling and Computation, 2:191-200, 2006.
6. E. Balas, S. Ceria, G. Cornúejols, and N. Natraj. Gomory Cuts Revisited. Operations Research Letters, 19:1-9, 1996.
7. E. Boros and P. L. Hammer. Pseudo-Boolean Optimization. Discrete Applied Mathematics, 123(1-3):155-225, 2002.
8. R. E. Bixby. Progress in Linear Programming. ORSA Journal on computing, 6(1):15-22, 1994.
9. E. Balas and R. G. Jeroslow. Strengthening cuts for mixed-integer programs. European Journal of Operational Research, 4:224-234, 1980.
10. E. Balas and J. B. Mazzola. Nonlinear 0-1 programming: I. Linearization techniques. Mathematical Programming, 30(1):1-21, 1984. (Pubitemid 14664161)
11. E. Balas and J. B. Mazzola. Nonlinear 0-1 programming: II. Dominance relations and algorithms. Mathematical Programming, 30(1):22-45, 1984. (Pubitemid 14664160)
12. B. Benhamou and L. Sä?s. Two proof procedures of cardinality based language in propositional calculus. In E. W. M. e. K. W. W. e. P. Enjalbert, editor, Proceedings 11th Int. Symposium on Theoretical As pects of Computer Science (STACS-94), volume 775, pages 71-82, Caen, France, February 1994. Springer Verlag.
13. S. Ceria, G. Cornúejols, and M. Dawande. Combining and Strengthening Gomory Cuts. In E. Balas and J. C. (eds.), editors, Proceedings of the 4th International IPCO Conference on Integer Programming and Combinatorial Optimization, volume 920 of Lec ture Notes in Computer Science, pages 438-451. Springer-Verlag, London, UK, May 1995.
14. V. Chv́atal. Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Mathematics, 4:305-337, 1973.
15. D. Chai and A. Kuehlmann. A Fast Pseudo-Boolean Constraint Solver. In Proceedings of the Design Automation Conference, pages 830-835, June 2003.
16. D. Chai and A. Kuehlmann. A Fast Pseudo-Boolean Constraint Solver. IEEE Transations on Computer-Aided Design of Integrated Circuits and Systems, 24(3):305-317, 2005.
17. O. Coudert and J. C. Madre. New Ideas for Solving Covering Problems. In DAC'95: Proceedings of the 32nd ACM/IEEE conference on Design automation, pages 641-646, New York, NY, USA, June 1995. ACM.
18. O. Coudert. Two-Level Logic Minimization, An Overview. Integration, The VLSI Journal, 17(2):677-691, October 1993.
19. O. Coudert. On Solving Covering Problems. In Proceedings of the Design Automation Conference, pages 197-202, June 1996.
20. G. B. Dantzig. Discrete-Variable Extremum Problems. Operations Research, 5:266-277, 1957.
21. J. De Kleer. An Assumption-Based TMS. Artificial Intelligence, 28(2):127-162, March 1986.
22. M. Davis and H. Putnam. A Computing Procedure for Quantification Theory. Journal of the Association for Computing Machinery, 7:201-215, July 1960.
23. N. Éen and N. S̈orensson. Translating Pseudo-Boolean Constraints into SAT. Journal on Satisfiability, Boolean Modeling and Computation, 2:2-26, 2006.
24. R. Fortet. Application de l'alg̀ebre de Boole en recherche oṕerationelle. Revue Fraņcaise de Recherche Oṕerationelle, 4:17-26, 1960.
25. R. E. Gomory. Outline of an algorithm for integer solutions to linear programs. Bulletin of the American Mathematical Society, 64:275-278, 1958.
26. R. E. Gomory. An Algorithm for the Mixed-Integer Problem. Technical Report RM-2597, Rand Corporation, 1960.
27. R. E. Gomory. An algorithm for integer solutions to linear programs. In Recent Advances in Mathematical Programming, pages 269-302. McGraw-Hill, New York, 1963.
28. A. Haken. The intractability of resolution. Theoretical Computer Science, 39:297-308, 1985.
29. J. Hooker. Logic-Based Methods for Optimization. Jon Wiley & Sons, 2000.
30. P. L. Hammer and S. Rudeanu. Boolean Methods in Operations Research and Related Areas. Springer Verlag, New York, 1968.
31. P. L. Hammer and B. Simeone. Combinatorial Optimization, volume 1403 of Lecture Notes in Mathematics, chapter Quadratic functions of binary variables, pages 1-56. Springer, 1989.
32. R. M. Karp. Reducibility Among Combinatorial Problems. In R. E. Miller and J. W. T. (eds.), editors, Complexity of Computer Computations, pages 85-103. Plenum Press, 1972.
33. S. Liao and S. Devadas. Solving Covering Problems Using LPRBased Lower Bounds. In Proceedings of the Design Automation Conference, pages 117-120, June 1997.
34. M. Lukasiewycz, M. Glas, T. Streichert, C. Haubelt, and J. Teich. Solving Multiobjective Pseudo-Boolean Problems. In Proceedings of Tenth International Conference on Theory and Applications of Satisfiability Testing, volume 4501, pages 56-69. Springer Berlin / Heidelberg, May 2007.
35. A. N. Letchford and A. Lodi. Strengthening Chvatal-Gomory cuts and Gomory fractional cuts. Operations Research Letters, 30(2):74-82, 2002.
36. I. Lynce and J. P. Marques-Silva. Efficient Data Structures for Backtrack Search SAT Solvers. Annals of Mathematics and Artificial Intelligence, 43:137-152, 2005.
37. E. L. Lawler and D. E. Wood. Branch-and-Bound Methods: A Survey. Operations Research, 14(4):699-719, 1966.
38. V. Manquinho and J. P. Marques-Silva. Satisfiability-Based Algorithms for Boolean Optimization. Annals of Mathematics and Artificial Intelligence, 40(3-4):353-372, March 2004.
39. V. Manquinho and J. P. Marques-Silva. Effective Lower Bounding Techniques for Pseudo-Boolean Optimization. In Proceedings of the Design and Test in Europe Conference, pages 660-665, March 2005. (Pubitemid 44172066)
40. V. Manquinho and J. P. Marques-Silva. On Using Cutting Planes in Pseudo-Boolean Optimization. Journal on Satisfiability, Boolean Modeling and Computation, 2:209-219, 2006. Special Issue on SAT 2005 competition and evaluations.
41. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an Efficient SAT Solver. In Proceedings of the Design Automation Conference, pages 530-535, June 2001.
42. V. Manquinho and O. Roussel. Pseudo-Boolean Evaluation 2007. http://www.cril.univ-artois.fr/PB07, 2007.
43. J. P. Marques-Silva and K. A. Sakallah. GRASP: A New Search Algorithm for Satisfiability. In Proceedings of the International Conference on Computer Aided Design, pages 220-227, November 1996.
44. G. L. Nemhauser and L. A. Wolsey. Integer and Combinatorial Optimization. John Wiley & Sons, 1988.
45. C. Sinz. Towards an Optimal CNF Encoding of Boolean Cardinality Constraints. In Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming, CP 2005, October 2005.
46. R. M. Stallman and G. J. Sussman. Forward Reasoning and Dependency-Directed Backtracking in a System for Computer-Aided Circuit Analysis. Artificial Intelligence, 9:135-196, October 1977.
47. H. Sheini and K. Sakallah. Pueblo: A Modern Pseudo-Boolean SAT Solver. In Proceedings of the Design and Test in Europe Conference, pages 684-685, March 2005.
48. H. Sheini and K. Sakallah. Pueblo: A Hybrid Pseudo-Boolean SAT Solver. Journal on Satisfiability, Boolean Modeling and Computation, 2:157-181, 2006. Special Issue on SAT 2005 competition and evaluations.
49. T. Schiex and G. Verfaillie. Nogood Recording for Static and Dynamic Constraint Satisfaction Problems. In Proceedings of the International Conference on Tools with Artificial Intelligence, pages 48-55, November 1993.
50. T. Villa, T. Kam, R. K. Brayton, and A. L. Sangiovanni-Vincentelli. Explicit and Implicit Algorithms for Binate Covering Problems. IEEE Transactions on Computer Aided Design, 16(7):677-691, July 1997.
51. J. P.Warners. A linear-time transformation of linear inequalities into conjunctive normal form. Information Processing Letters, 68(2):63-69, 1998.
52. H. P. Williams. Fourier-Motzkin Elimination Extension to Integer Programming Problems. Journal of Combinatorial Theory, 21:118-123, 1976.
53. H. Zhang. SATO: An Efficient Propositional Prover. In Proceedings of the International Conference on Automated Deduction, pages 272- 275, July 1997.
54. R. Zabih and D. A. McAllester. A Rearrangement Search Strategy for Determining Propositional Satisfiability. In Proceedings of the National Conference on Artificial Intelligence, pages 155-160, July 1988.
55. L. Zhang, C. Madigan, M. Moskewicz, and S. Malik. Efficient Conflict Driven Learning in a Boolean Satisfiability Solver. In Proceedings of the International Conference on Computer Aided Design, pages 279-285, November 2001.