This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Solving Satisfiability in Combinational Circuits
July/August 2003 (vol. 20 no. 4)
pp. 16-21
Jo? Marques-Silva, Technical University of Lisbon
Lu? Guerra e Silva, Technical University of Lisbon

Editor's note:
As EDA evolves, researchers continue to find modeling tools to solve problems of test generation, design verification, logic, and physical synthesis, among others. One such modeling tool is Boolean satisfiability (SAT), which has very broad applicability in EDA. The authors review modern SAT algorithms, show how these algorithms can account for structural information in combinational circuits, and explain what recursive learning can add to SAT.
—Marcelo Lubaszewski, Federal University of Rio Grande do Sul

Citation:
Jo? Marques-Silva, Lu? Guerra e Silva, "Solving Satisfiability in Combinational Circuits," IEEE Design & Test of Computers, vol. 20, no. 4, pp. 16-21, July-Aug. 2003, doi:10.1109/MDT.2003.1214348
Usage of this product signifies your acceptance of the Terms of Use.