<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://debianws.lexgopc.com/wiki143/index.php?action=history&amp;feed=atom&amp;title=Chaff_algorithm</id>
	<title>Chaff algorithm - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://debianws.lexgopc.com/wiki143/index.php?action=history&amp;feed=atom&amp;title=Chaff_algorithm"/>
	<link rel="alternate" type="text/html" href="http://debianws.lexgopc.com/wiki143/index.php?title=Chaff_algorithm&amp;action=history"/>
	<updated>2026-05-09T18:47:19Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.43.1</generator>
	<entry>
		<id>http://debianws.lexgopc.com/wiki143/index.php?title=Chaff_algorithm&amp;diff=1474700&amp;oldid=prev</id>
		<title>imported&gt;Graeme Bartlett: mark software names</title>
		<link rel="alternate" type="text/html" href="http://debianws.lexgopc.com/wiki143/index.php?title=Chaff_algorithm&amp;diff=1474700&amp;oldid=prev"/>
		<updated>2023-09-28T23:56:06Z</updated>

		<summary type="html">&lt;p&gt;mark software names&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;{{Short description|Programming algorithm}}{{no footnotes|date=July 2017}}&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Chaff&amp;#039;&amp;#039;&amp;#039; 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.&lt;br /&gt;
&lt;br /&gt;
== Implementations ==&lt;br /&gt;
&lt;br /&gt;
Some available implementations of the algorithm in software are &amp;lt;code&amp;gt;mChaff&amp;lt;/code&amp;gt; and &amp;#039;&amp;#039;&amp;#039;&amp;lt;code&amp;gt;zChaff&amp;lt;/code&amp;gt;&amp;#039;&amp;#039;&amp;#039;, the latter one being the most widely known and used. zChaff was originally written by Dr. Lintao Zhang, {{clarify span|now|reason=Since when?|date=April 2019}} 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.&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
{{reflist}}&lt;br /&gt;
* M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, S. Malik. &amp;#039;&amp;#039;[http://www.princeton.edu/~chaff/publication/DAC2001v56.pdf Chaff: Engineering an Efficient SAT Solver]&amp;#039;&amp;#039;, 39th Design Automation Conference (DAC 2001), Las Vegas, ACM 2001.&lt;br /&gt;
* {{Cite journal | last1 = Vizel | first1 = Y. | last2 = Weissenbacher | first2 = G. | last3 = Malik | first3 = S. | journal = Proceedings of the IEEE | volume = 103 | issue = 11 | year = 2015 | doi = 10.1109/JPROC.2015.2455034|title=Boolean Satisfiability Solvers and Their Applications in Model Checking| pages = 2021–2035 | s2cid = 10190144 }}&lt;br /&gt;
&lt;br /&gt;
== External links ==&lt;br /&gt;
* [http://www.princeton.edu/~chaff/zchaff.html Web page about zChaff]&lt;br /&gt;
&lt;br /&gt;
[[Category:SAT solvers]]&lt;br /&gt;
[[Category:Boolean algebra]]&lt;br /&gt;
[[Category:Automated theorem proving]]&lt;br /&gt;
[[Category:Constraint programming]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{formalmethods-stub}}&lt;/div&gt;</summary>
		<author><name>imported&gt;Graeme Bartlett</name></author>
	</entry>
</feed>