Satisfiability-based algorithms for Boolean optimization

Annals of Mathematics and Artificial Intelligence

Volumn 40, Issue 3-4, 2004, Pages 353-372

  Manquinho, Vasco M ^a   Marques Silva, João P ^a  

^a INSTITUTO SUPERIOR TÉCNICO   (Portugal)

Author keywords

Backtrack search; Binate covering problem; Branch and bound; Non chronological backtracking; Propositional satisfiability

Indexed keywords

EID: 4043152845     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1023/b:amai.0000012872.46214.11     Document Type: Article

References (22)

1. 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).
2. R. Bayardo Jr. and R. Schrag, Using CSP look-back techniques to solve real-world SAT instances, in: Proceedings of the National Conference on Artificial Intelligence (1997).
3. M.S. Bazaraa, J.J. Jarvis and H.D. Sherali, Linear Programming and Network Flows, 2nd ed. (John Wiley & Sons, 1989).
4. O. Coudert, Two-level logic minimization, an overview, Integration, The VLSI Journal 17(2) (October 1993) 677-691.
5. O. Coudert, On solving covering problems, in: Proceedings of the ACM/IEEE Design Automation Conference (June 1996).
6. O. Coudert and J.C. Madre, New ideas for solving covering problems, in: Proceedings of the ACM/IEEE Design Automation Conference (June 1995).
7. M. Davis and H. Putnam, A computing procedure for quantification theory, Journal of the Association for Computing Machinery 7 (1960) 201-215.
8. D. De Micheli, Synthesis and Optimization of Digital Circuits (McGraw-Hill, 1994).
9. P.F. Flores, H.C. Neto and J.P. Marques Silva, An exact solution to the minimum-size test pattern problem, in: Proceedings of the IEEE International Conference on Computer Design (October 1998) pp. 510-515.
10. J. Gimpel, A reduction technique for prime implicant tables, IEEE Transactions on Electronic Computers EC-14 (August 1965) 535-541.
11. E. Goldberg, L. Carloni, T. Villa, R.K. Brayton and A.L. Sangiovanni-Vincentelli, Negative thinking by incremental problem solving: application to unate covering, in: Proceedings of the ACM/IEEE International Conference on Computer-Aided Design (1997).
12. G. Hachtel and F. Somenzi, Logic Synthesis and Verification Algorithms (Kluwer Academic Publishers, 1996).
13. S. Liao and S. Devadas, Solving covering problems using LPR-based lower bounds, in: Proceedings of the ACM/IEEE Design Automation Conference (1997).
14. V.M. Manquinho, P.F. Flores, J.P. Marques Silva and A.L. Oliveira, Prime implicant computation using satisfiability algorithms, in: Proceedings of the IEEE International Conference on Tools with Artificial Intelligence (November 1997) pp. 232-239.
15. J.P. Marques Silva and K.A. Sakallah, GRASP: A new search algorithm for satisfiability, in: Proceedings of the ACM/IEEE International Conference on Computer-Aided Design (November 1996) pp. 220-227.
16. M.R.C.M. Berkelaar, UNIX manual page of lp-solve, in: Eindhoven University of Technology, Design Automation Section, ftp://ftp.es.ele.tue.nl/ pub/lp_solve (1992).
17. G.L. Nemhauser and L. Wolsey, Integer and Combinatorial Optimization (John Wiley & Sons, 1988).
18. C. Pizzuti, Computing prime implicants by integer programming, in: Proceedings of the IEEE International Conference on Tools with Artificial Intelligence (November 1996) pp. 332-336.
19. S.J. Russell and P. Norvig, Artificial Intelligence: A Modern Approach (Prentice-Hall, 1994).
20. 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) (July 1997) 677-691.
21. S. Yang, Logic Synthesis and Optimization Benchmarks User Guide (Microelectronics Center of North Carolina, January 1991).
22. H. Zhang, SATO: An efficient propositional prover, in: Proceedings of the International Conference on Automated Deduction (July 1997) pp. 272-275.