SATO: An efficient propositional prover (1997) [145 citations — 6 self]
|
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Zhang97sato:an,author = {Hantao Zhang},
title = {SATO: An efficient propositional prover},
booktitle = {In Proceedings of the International Conference on Automated Deduction},
year = {1997},
pages = {272--275},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Abstract:
SATO (Satisfiability Testing Optimized) is a propositional prover based on the Davis-Putnam method [3], which is is one of the major practical methods for the satisfiability (SAT) problem of propositional logic. The first report of SATO appeared in [12]. Since then, we constantly add new techniques into SATO to make it more efficient [14, 13]. One of the major motivations to develop SATO was to attack open Latin square problems. While SATO works well on Latin square problems, its previous versions did not work well on many classes of the SAT problem. In the fall of 1996, we made an effort to improve SATO so that it works well on a large set of the SAT problem. In the following, we discuss briefly two techniques that we found effective to improve SATO performance. One is about splitting rules; the other is about conflict analysis. While these two techniques are known in the community, the real challenge is how to integrate these techniques without weakening each other. We are happy to report here that the two techniques integrated very well with the techniques previously implemented in SATO. In
