Chaff algorithm
≈ 1 min read
Names in other languages
- EnglishChaff algorithm
- हिन्दीचैफ़ एल्गोरिद्म
- PortuguêsAlgoritmo Chaff
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
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
edit edit sourceSome 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, 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
edit edit source- 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
edit edit sourceText derived from https://en.wikipedia.org/w/index.php?oldid=1298376698 under CC BY-SA 4.0; modifications have been made.