Chaff algorithm - Revision history

Graeme Bartlett: mark software names

2023-09-28T23:56:06Z

mark software names

← Previous revision		Revision as of 23:56, 28 September 2023
Line 4:		Line 4:
	== Implementations ==		== 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, {{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.		Some available implementations of the algorithm in software are <code>mChaff</code> and '''<code>zChaff</code>''', 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.

	== References ==		== References ==

Citation bot: Add: s2cid, pages. | Use this bot. Report bugs. | #UCB_CommandLine 508/9214

2023-07-24T06:20:50Z

Add: s2cid, pages. | Use this bot. Report bugs. | #UCB_CommandLine 508/9214

← Previous revision		Revision as of 06:20, 24 July 2023
Line 9:		Line 9:
	{{reflist}}		{{reflist}}
	* M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, S. Malik. ''[http://www.princeton.edu/~chaff/publication/DAC2001v56.pdf Chaff: Engineering an Efficient SAT Solver]'', 39th Design Automation Conference (DAC 2001), Las Vegas, ACM 2001.		* M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, S. Malik. ''[http://www.princeton.edu/~chaff/publication/DAC2001v56.pdf Chaff: Engineering an Efficient SAT Solver]'', 39th Design Automation Conference (DAC 2001), Las Vegas, ACM 2001.
	* {{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}}		* {{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 }}

	== External links ==		== External links ==

136.53.118.244 at 21:40, 14 January 2023

2023-01-14T21:40:08Z

← Previous revision		Revision as of 21:40, 14 January 2023
Line 1:		Line 1:
	{{Short description\|Programming algorithm}}{{no footnotes\|date=July 2017}}		{{Short description\|Programming algorithm}}{{no footnotes\|date=July 2017}}
	'''Chaff''' is an [[algorithm]] for solving instances of the [[Boolean satisfiability problem]] in programming. It was designed by researchers at [[Princeton University]]~~, United States~~. The algorithm is an instance of the [[DPLL algorithm]] with a number of enhancements for efficient implementation.		'''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 ==		== Implementations ==

Narcowiz: #suggestededit-add 1.0

2021-09-25T21:02:41Z

#suggestededit-add 1.0

← Previous revision		Revision as of 21:02, 25 September 2021
Line 1:		Line 1:
	{{no footnotes\|date=July 2017}}		{{Short description\|Programming algorithm}}{{no footnotes\|date=July 2017}}
	'''Chaff''' is an [[algorithm]] for solving instances of the [[Boolean satisfiability problem]] in programming. It was designed by researchers at [[Princeton University]], United States. The algorithm is an instance of the [[DPLL algorithm]] with a number of enhancements for efficient implementation.		'''Chaff''' is an [[algorithm]] for solving instances of the [[Boolean satisfiability problem]] in programming. It was designed by researchers at [[Princeton University]], United States. The algorithm is an instance of the [[DPLL algorithm]] with a number of enhancements for efficient implementation.

WOSlinker: remove unused refend

2020-01-17T08:46:42Z

remove unused refend

← Previous revision		Revision as of 08:46, 17 January 2020
Line 10:		Line 10:
	* M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, S. Malik. ''[http://www.princeton.edu/~chaff/publication/DAC2001v56.pdf Chaff: Engineering an Efficient SAT Solver]'', 39th Design Automation Conference (DAC 2001), Las Vegas, ACM 2001.		* M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, S. Malik. ''[http://www.princeton.edu/~chaff/publication/DAC2001v56.pdf Chaff: Engineering an Efficient SAT Solver]'', 39th Design Automation Conference (DAC 2001), Las Vegas, ACM 2001.
	* {{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}}		* {{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}}
	{{refend}}

	== External links ==		== External links ==

Jochen Burghardt: Undid revision 891605712 by Wbm1058 (talk): previous edit, by AnomieBOT, had deleted the span argument

2019-04-09T08:08:06Z

Undid revision 891605712 by Wbm1058 (talk): previous edit, by AnomieBOT, had deleted the span argument

← Previous revision		Revision as of 08:08, 9 April 2019
Line 4:		Line 4:
	== Implementations ==		== 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, {{clarify\|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.		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, {{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.

	== References ==		== References ==

Wbm1058: correct template to use here

2019-04-09T01:19:49Z

correct template to use here

← Previous revision		Revision as of 01:19, 9 April 2019
Line 4:		Line 4:
	== Implementations ==		== 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, {{clarify ~~span~~\|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.		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, {{clarify\|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.

	== References ==		== References ==

AnomieBOT: Dating maintenance tags: {{Clarify span}}

2019-04-08T17:02:59Z

Dating maintenance tags: {{Clarify span}}

← Previous revision		Revision as of 17:02, 8 April 2019
Line 4:		Line 4:
	== Implementations ==		== 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, {{clarify span~~\|now~~\|reason=Since when?}} 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.		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, {{clarify span\|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.

	== References ==		== References ==

Jochen Burghardt: /* Implementations */

2019-04-08T16:42:04Z

Implementations

← Previous revision		Revision as of 16:42, 8 April 2019
Line 4:		Line 4:
	== Implementations ==		== 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 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.		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, {{clarify span\|now\|reason=Since when?}} 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 ==		== References ==

Widefox: Added {{no footnotes}} tag to article (TW)

2017-07-28T15:51:35Z

Added {{no footnotes}} tag to article (TW)

← Previous revision		Revision as of 15:51, 28 July 2017
Line 1:		Line 1:
			{{no footnotes\|date=July 2017}}
	'''Chaff''' is an [[algorithm]] for solving instances of the [[Boolean satisfiability problem]] in programming. It was designed by researchers at [[Princeton University]], United States. The algorithm is an instance of the [[DPLL algorithm]] with a number of enhancements for efficient implementation.		'''Chaff''' is an [[algorithm]] for solving instances of the [[Boolean satisfiability problem]] in programming. It was designed by researchers at [[Princeton University]], United States. The algorithm is an instance of the [[DPLL algorithm]] with a number of enhancements for efficient implementation.