MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  An efficient algorithm for unit propagation (1996) [32 citations — 0 self]

Download:
Download as a PDF | Download as a PS
by Hantao Zhang, Mark E. Stickel
In Proceedings of the Fourth International Symposium on Artificial Intelligence and Mathematics (AI-MATH’96), Fort Lauderdale (Florida USA
http://www.cs.uiowa.edu/ftp/hzhang/sato/papers/aim96.ps.Z
Add To MetaCart

Abstract:

In recent years, there has been considerable renewed interest in the satisfiability (SAT) problem of propositional logic. Many tools for the SAT problem use unit propagation.

Citations

778 A computing procedure for quantification theory – Davis, Putnam - 1960
307 A machine program for theorem-proving – Davis, Logemann, et al. - 1962
232 H.: Linear-time algorithms for testing the satisfiability of propositional Horn formulae – Dowling, Gallier - 1984
194 Experimental results on the crossover point in satisfiability problems – Crawford, Auton - 1996