Chaff algorithm

From Wikipedia, the free encyclopedia
Revision as of 23:56, 28 September 2023 by imported>Graeme Bartlett (mark software names)
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Template:Short descriptionTemplate:No footnotes Chaff is an algorithm for solving instances of the Boolean satisfiability problem in programming. It was designed by researchers at Princeton University. The algorithm is an instance of the DPLL algorithm with a number of enhancements for efficient implementation.

Implementations

Some available implementations of the algorithm in software are mChaff and zChaff, the latter one being the most widely known and used. zChaff was originally written by Dr. Lintao Zhang, Template:Clarify span at Microsoft Research, hence the “z”. It is now maintained by researchers at Princeton University and available for download as both source code and binaries on Linux. zChaff is free for non-commercial use.

References

Template:Reflist

  • M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, S. Malik. Chaff: Engineering an Efficient SAT Solver, 39th Design Automation Conference (DAC 2001), Las Vegas, ACM 2001.
  • Script error: No such module "Citation/CS1".

External links


Template:Formalmethods-stub