Jump to content

Satz (SAT solver)

From Wikipedia, the free encyclopedia

This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these template messages)

This article relies largely or entirely on a single source. Relevant discussion may be found on the talk page. Please help improve this article by introducing citations to additional sources.
Find sources: "Satz" SAT solver – news · newspapers · books · scholar · JSTOR (November 2020)

This article includes a list of references, related reading, or external links, but its sources remain unclear because it lacks inline citations. Please help improve this article by introducing more precise citations. (November 2020) (Learn how and when to remove this message)

The topic of this article may not meet Wikipedia's general notability guideline. Please help to demonstrate the notability of the topic by citing reliable secondary sources that are independent of the topic and provide significant coverage of it beyond a mere trivial mention. If notability cannot be shown, the article is likely to be merged, redirected, or deleted.
Find sources: "Satz" SAT solver – news · newspapers · books · scholar · JSTOR (January 2021) (Learn how and when to remove this message)

(Learn how and when to remove this message)

SatZ is a well known SAT instance solver. It was developed by Prof. Chu Min Li, a computer science researcher. The Z stands for the last version of SAT solvers.

References[edit]

Chu Min Li and Anbulagan: Heuristics Based on Unit Propagation for Satisfiability Problems. Proceedings of IJCAI, 366–371, 1997

This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Satz_(SAT_solver)&oldid=997644246"

Hidden categories: