A fast pseudo-boolean constraint solver

Proceedings - Design Automation Conference

Volumn , Issue , 2003, Pages 830-835

  Chai, Donald ^a   Kuehlmann, Andreas ^a,b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b CADENCE DESIGN SYSTEMS   (United States)

Author keywords

0 1 ILP; Pseudo Boolean; Satisfiability

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; CONSTRAINT THEORY; DECISION THEORY; INFERENCE ENGINES; INTEGER PROGRAMMING; LEARNING SYSTEMS;

OBJECTIVE FUNCTIONS;

SYSTEMS ANALYSIS;

EID: 0042134647     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/776038.776041     Document Type: Conference Paper

References (18)

1. J. P. Marques-Silva and K. A. Sakallah, "GRASP: a search algorithm for prepositional satisfiability," IEEE Trans. on Computers, vol. 48, no. 5, pp. 506-521, 1999.
2. M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik, "Chaff: Engineering an efficient SAT solver," in Proceedings of the 38th ACM/IEEE Design Automation Conference, (Las Vegas, Nevada), pp. 530-535, June 2001.
3. S. Devadas, "Optimal layout via Boolean satisfiability," in IEEE/ACM Inter'l Conference on CAD, pp. 294-297, November 1989.
4. R. G. Wood and R. A. Rutenbar, "FPGA routing and routability estimation via Boolean satisfiability," IEEE Trans. on VLSI Systems, pp. 222-231, June 1998.
5. F. A. Aloul, A. Ramani, I. L. Markov, and K. A. Sakallah, "Generic ILP versus specialized 0-1 ILP: An update," in IEEE/ACM Int. Conference on Computer-Aided Design, pp. 450-457, November 2002.
6. A. Haken, "The intractability of resolution," Theoretical Computer Science, vol. 39, pp. 297-308, 1985.
7. M. Davis and H. Putnam, "A computing procedure for quantification theory," Journal of of the Assoc. of for Computing Machinery, vol. 7, pp. 102-215, 1960.
8. M. Davis, G. Logeman, and D. Loveland, "A machine program for theorem proving," Communications of the ACM, vol. 5, pp. 394-397, July 1962.
9. R. Gomory, An algorithm for integer solutions to linear programs. New York: McGraw-Hill, 1963.
10. V. Chvátal, "Edmonds polytopes and a hierarchy of combinatorial problems," Discrete Mathematics, vol. 4, pp. 305-337, 1973.
11. H. E. Dixon and M. L. Ginsberg, "Combining satisfiability techniques from AI and OR," The Knowledge Engineering Review, vol. 15, pp. 31-45, March 2000.
12. M. Davis and H. Putnam, "A computing procedure for quantification theory," Journal of the ACM, vol. 7, pp. 102-215, 1960.
13. P. Barth, Logic-Based 0-1 Constraint Programming. Kluwer Academic Publishers, 1995.
14. R. M. Stallman and G. J. Sussman, "Forward reasoning and dependency directed backtracking in a system for computer aided circuit analysis," Artificial Intelligence, vol. 9, no. 2, pp. 135-196, 1977.
15. V. Chandru and J. Hooker, Optimization Methods for Logical Inference. New York: John Willey & Sons, Inc., 1999.
16. H. E. Dixon and M. L. Ginsberg, "Inference methods for a pseudo-Boolean satisfiability solver," in National Conference on Artificial Intelligence, 2002.
17. J. P. Walser, "0-1 integer optimization benchmarks." http://www.ps.unisb.de/walser/benchmarks/benchmarks.html
18. M. S. Hung, W. O. Rom, and A. D. Waren, Optimization with IBM OSL. Scientific Press, 1993.