On using satisfiability-based pruning techniques in covering algorithms

Proceedings -Design, Automation and Test in Europe, DATE

Volumn , Issue , 2000, Pages 356-363

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

^a INSTITUTO SUPERIOR TÉCNICO   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN SATISFIABILITY; COVERING ALGORITHMS; COVERING PROBLEMS; DIFFERENT CLASS; ELECTRONIC DESIGN AUTOMATION; MODELING TOOL; PERFORMANCE GAIN; PRUNING TECHNIQUES;

COMPUTER AIDED SOFTWARE ENGINEERING; EXHIBITIONS;

ALGORITHMS;

EID: 8344226721     PISSN: 15301591     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DATE.2000.840296     Document Type: Conference Paper

References (16)

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. O. Coudert. Two-Level Logic Minimization, An Overview. Integration, The VLSI Journal, vol. 17(2):677-691, October 1993.
3. O. Coudert. On Solving Covering Problems. In Proceedings of the ACM/IEEE Design Automation Conference, June 1996.
4. O. Coudert and J. C. Madre. New Ideas for Solving Covering Problems. In Proceedings of the ACM/IEEE Design Automation Conference, June 1995.
5. M. Davis and H. Putnam. A Computing Procedure for Quantification Theory. Journal of the Association for Computing Machinery, vol. 7:201-215, 1960.
6. 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, pages 510-515, October 1998.
7. J. Gimpel. A Reduction Technique for Prime Implicant Tables. IEEE Transactions on Electronic Computers, vol. EC-14:535-541, August 1965.
8. 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.
9. G. Hachtel and F. Somenzi. Logic Synthesis and Verification Algorithms. Kluwer Academic Pub., 1996.
10. S. Liao and S. Devadas. Solving Covering Problems Using LPRBased Lower Bounds. In Proceedings of the ACM/IEEE Design Automation Conference, 1997.
11. 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, pages 232-239, November 1997.
12. D. De Micheli. Synthesis and Optimization of Digital Circuits. McGraw-Hill, 1994.
13. G. L. Nemhauser and L. A. Wosley. Integer and Combinatorial Optimization. John Wiley & Sons, 1988.
14. 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, pages 220-227, November 1996.
15. 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, vol. 16(7):677-691, July 1997.
16. S. Yang. Logic Synthesis and Optimization Benchmarks User Guide. Microelectronics Center of North Carolina, January 1991.