Skip to main content
  • 468 Accesses

This chapter provides the background on Boolean Satisfiability (SAT) necessary for the description, in the next chapter, of an ATPG engine based on SAT. The main concepts of SAT solvers are reviewed in Section 3.1. An overview of advanced SAT techniques is given in Section 3.2. In Section 3.3, the standard transformation of a given circuit into constraints for a SAT solver is introduced. Finally, Section 3.4 provides a short overview of circuit-oriented SAT techniques.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

(2009). Boolean Satisfiability. In: Test Pattern Generation using Boolean Proof Engines. Springer, Dordrecht. https://doi.org/10.1007/978-90-481-2360-5_3

Download citation

  • DOI: https://doi.org/10.1007/978-90-481-2360-5_3

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-2359-9

  • Online ISBN: 978-90-481-2360-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics