Chaff algorithm
Jump to navigation
Jump to search
![]() | This article includes a list of references, related reading, or external links, but its sources remain unclear because it lacks inline citations. (July 2017) |
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, now[clarify] 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
- 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.
- Vizel, Y.; Weissenbacher, G.; Malik, S. (2015). "Boolean Satisfiability Solvers and Their Applications in Model Checking". Proceedings of the IEEE. 103 (11): 2021–2035. doi:10.1109/JPROC.2015.2455034. S2CID 10190144.
External links
Categories:
- Articles with short description
- Short description matches Wikidata
- Articles lacking in-text citations from July 2017
- All articles lacking in-text citations
- All Wikipedia articles needing clarification
- Wikipedia articles needing clarification from April 2019
- SAT solvers
- Boolean algebra
- Automated theorem proving
- Constraint programming
- All stub articles
- Formal methods stubs