The Multi-SAT Algorithm

  title={The Multi-SAT Algorithm},
  author={Jun Gu},
  journal={Discrete Applied Mathematics},
Many e cient algorithms have been developed for satis ability testing. They complement rather than exclude each other by being e ective for particular problem instances. In this research, we give a Multi-SAT algorithm for the SAT problem. The Multi-SAT algorithm integrates several e cient SAT algorithms. It makes use of di erent algorithmic niches for satisability testing. Based on cost-e ective cluster computing, Multi-SAT can perform simultaneous satis ability testing, using several “stones… CONTINUE READING


Publications citing this paper.
Showing 1-3 of 3 extracted citations

Optimization Software Class Libraries

Operations Research/Computer Science Interfaces Series • 2002
View 7 Excerpts
Highly Influenced

Meta-heuristics: The State of the Art

Local Search for Planning and Scheduling • 2000
View 1 Excerpt


Publications referenced by this paper.
Showing 1-10 of 92 references

Global optimization for satis ability (SAT) problem

J. Gu
IEEE Trans. Knowledge Data Eng. 6 (3) (1994) 361–381; 7 (1) • 1995
View 6 Excerpts
Highly Influenced

A divide-and-conquer approach for asynchronous circuit design, in Proceedings of the seventh

R. Puri, J. Gu
IEEE International Symposium on High-Level Synthesis, • 1994
View 2 Excerpts
Highly Influenced

Local search for satis ability (SAT) problem

J. Gu
IEEE Trans. Systems Man Cybernet. 23 (4) (1993) 1108–1129 and 24 (4) • 1994
View 5 Excerpts
Highly Influenced

E cient local search for very large-scale satis ability problem

J. Gu
SIGART Bull. 3 (1) • 1992
View 8 Excerpts
Highly Influenced

Lagrangian methods for satis ability problems

B. W. Wah, Y. Shang
DIMACS Volume Series on Discrete Mathematics and Theoretical Computer Science: The Satis ability (SAT) Problem, American Mathematical Society, Providence, RI • 1997
View 2 Excerpts

A fast parallel SAT-solver — efficient workload balancing

Annals of Mathematics and Artificial Intelligence • 1996
View 1 Excerpt

Local search strategies for satis ability testing

B. Selman, H. A. Kautz, B. Cohen
DIMACS Series Volume: Clique, Graph Coloring, and Satis ability – Second DIMACS Implementation Challenge, American Mathematical Society, Providence, RI • 1996
View 1 Excerpt

Satis ability problems in VLSI engineering, Presented at the 1995

J. Gu
INFORMS Annual Conference and the 1996 DIMACS Workshop on Satis ability (SAT) Problem, • 1996
View 1 Excerpt

The Unison algorithm: fast evaluation of Boolean expressions

ACM Trans. Design Autom. Electr. Syst. • 1996
View 1 Excerpt

An e cient implementation of SAT1.5

J. Gu, H. Li, Z. Zhou, B. Du
View 3 Excerpts

Similar Papers

Loading similar papers…