A fast pseudo-Boolean constraint solver

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 24, Issue 3, 2005, Pages 305-317

  Chai, Donald ^a   Kuehlmann, Andreas ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b CADENCE DESIGN SYSTEMS   (United States)

Author keywords

0 1 integer programming; Boolean satisfiability; Optimization

Indexed keywords

CONSTRAINT THEORY; INTEGER PROGRAMMING; LEARNING ALGORITHMS; LINEAR PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING;

0-1 INTEGER PROGRAMMING; APPLICATION OF SATISFIABILITY (AS); BOOLEAN SATISFIABILITY; ELECTRONIC DESIGN AUTOMATION (EDA); LINEAR PSEUDO-BOOLEAN (LPB) CONSTRAINT;

BOOLEAN FUNCTIONS;

EID: 15244363740     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCAD.2004.842808     Document Type: Article

References (33)

1. A. Biere, A. Cimatti, E. M. Clarke, and Y. Zhu, "Symbolic model checking without BDD's," in Proc. 5th Int. Conf. Tools Algorithms Construction Anal. Syst., Amsterdam, The Netherlands, Mar. 1999, pp. 193-207.
2. J. P. Marques-Silva and K. A. Sakallah, "GRASP: A search algorithm for prepositional satisfiability," IEEE Trans. Comput., vol. 48, no. 5, pp. 506-521, May 1999.
3. M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik, "Chaff: Engineering an efficient SAT solver," in Proc. 38th ACM/IEEE Design Automation Conf., Las Vegas, NV, Jun. 2001, pp. 530-535.
4. T. Niermann and J. H. Patel, "HITEC: A test generation package for sequential circuits," in Proc. Eur. Conf. Design Automation, Feb. 1991, pp. 214-218.
5. C.-W. Chang and M. Marek-Sadowska, "Single-pass redundancy addition and removal," in Dig. Tech. Papers IEEE/ACM Int. Conf. Computer-Aided Design, San Jose, CA, Nov. 2001, pp. 606-609.
6. S. Devadas, "Optimal layout via Boolean satisfiability," in Dige. Tech. Papers IEEE/ACM Int. Conf. Computer-Aided Design, Santa Clara, CA, Nov. 1989, pp. 294-297.
7. R. G. Wood and R. A. Rutenbar, "FPGA routing and routability estimation via Boolean satisfiability," IEEE Trans. VLSI Syst., vol. 6, no. 2, pp. 222-231, Jun. 1998.
8. J. Monteiro, S. Devadas, A. Ghosh, K. Keutzer, and J. White, "Estimation of average switching activity in combinational logic circuits using symbolic simulation," IEEE Trans. Computer-Aided Design Integr. Circuits Syst., vol. 16, no. 1, pp. 121-127, Jan. 1997.
9. F. A. Aloul, A. Ramani, I. L. Markov, and K. A. Sakallah, "Generic ILP versus specialized 0-1 ILP: An update," in Dige.Tech. Papers IEEE/ACM Int. Conf. Computer-Aided Design, San Jose, CA, Nov. 2002, pp. 450-457.
10. A. Haken, "The intractability of resolution," Theoretical Comput. Sci., vol. 39, pp. 297-308, 1985.
11. M. Davis and H. Putnam, "A computing procedure for quantification theory," J. Assoc. Comput. Mach., vol. 7, pp. 102-215, 1960.
12. M. Davis, G. Logemann, and D. Loveland, "A machine program for theorem proving," Commun. ACM, vol. 5, pp. 394-397, 1962.
13. R. Gomory, An Algorithm for Integer Solutions to Linear Programs. New York: McGraw-Hill, 1963, pp. 269-302.
14. V. Chvátal, "Edmonds polytopes and a hierarchy of combinatorial problems," Discrete Math., vol. 4, pp. 305-337, 1973.
15. H. E. Dixon and M. L. Ginsberg, "Combining satisfiability techniques from AI and OR," Knowledge Eng. Rev., vol. 15, pp. 31-45, 2000.
16. R. M. Stallman and G. J. Sussman, "Forward reasoning and dependency directed backtracking in a system for computer aided circuit analysis," Artif. Intell, vol. 9, no. 2, pp. 135-196, 1977.
17. G. Nemhauser and L. A. Wolsey, Integer and Combinatorial Optimization. New York: Wiley, 1988.
18. J. Hooker, "Generalized resolution for 0-1 linear inequalities," Ann. Math. Artif. Intell., vol. 6, pp. 271-286, 1992.
19. P. Barth, "Linear 0-1 Inequalities and Extended Clauses," Max-Planck-Institut Für Informatik, Tech. Rep. MPI-I-94-216, Apr. 1994.
20. _, OPBDP-A Davis-Putnam Based Enumeration Algorithm for Linear Pseudo-Boolean Optimization.
21. _, Logic-Based 0-1 Constraint Programming. Norwell, MA: Kluwer, 1995.
22. E. Balas, S. Ceria, and G. Comuejols, "A lift-and-project cutting plane algorithm for mixed 0-1 programs," Math. Program., vol. 58, pp. 295-324, 1993.
23. F. Eisenbrand, G. Rinaldi, and P. Ventura, "0/1 optimization and 0/1 primal separation are equivalent," in Proc. ACM-SIAM Symp. Discrete Algorithms, 2002, pp. 920-926.
24. G. Tseitin, "On the complexity of derivation in prepositional calculus," in Vol. 8 of Seminars in Mathematics, Leningrad: V. A. Steklov Mathematical Institute, 1968, pp. 115-125. English translation: Studies in mathematics and mathematical logic, Part II, 1970.
25. G. Tseitin, "On the complexity of derivation in prepositional calculus," in Vol. 8 of Seminars in Mathematics, Leningrad: V. A. Steklov Mathematical Institute, 1968, pp. 115-125. English translation: Studies in mathematics and mathematical logic, Part II, 1970.
26. J. Hooker, Logic-Based Methods for Optimization. New York: Wiley, 2000.
27. J. F. Benders, "Partitioning procedures for solving mixed-variables programming problems," Numer. Math., vol. 4, pp. 238-252, 1962.
28. H. E. Dixon and M. L. Ginsberg, "Inference methods for a pseudo-Boolean satisfiability solver," in Proc. Nat. Conf. Artif. Intell., 2002, pp. 635-640.
29. L. Zhang, C. F. Madigan, M. H. Moskewicz, and S. Malik, "Efficient conflict driven learning in a boolean satisfiability solver," in Proc. Int. Conf. Computer-Aided Design, 2001, pp. 279-285.
30. S. Pilarski and G. Hu, "SAT with partial clauses and back-leaps," in Design Automation Conf., 2002, pp. 743-746.
31. J. P. Walser, 0-1 Integer Optimization Benchmarks.
32. S. Seshia and S. Lahiri, UCLID Verification Benchmarks.
33. M. S. Hung, W. O. Rom, and A. D. Waren, Optimization with IBM OSL. San Francisco, CA: Scientific, 1993.