Name
Abstract | ||
|---|---|---|
The Boolean Satisfiability Problem (SAT) is a well known NP-Complete problem. While its complexity remains a source of many interesting questions for theoretical computer scientists, the problem has found many practical applications in recent years. The emergence of efficient SAT solvers which can handle large structured SAT instances has enabled the use of SAT solvers in diverse domains such as electronic design automation and artificial intelligence. These applications continue to motivate the development of faster and more robust SAT solvers. In this paper, we describe the popular SAT solver zchaff with a focus on recent developments. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/11527695_27 | SAT (Selected Papers |
Keywords | Field | DocType |
efficient sat solvers,artificial intelligence,sat solvers,popular sat solver zchaff,robust sat solvers,recent development,large structured sat instance,boolean satisfiability problem,recent year,np-complete problem,sat solver,np complete problem,boolean satisfiability | Constraint satisfaction,Discrete mathematics,Computer science,Satisfiability,Boolean satisfiability problem,Propositional calculus,Automation,Electronic design automation,Conjunctive normal form,Boolean algebra | Conference |
Volume | ISSN | ISBN |
3542 | 0302-9743 | 3-540-27829-X |
Citations | PageRank | References |
57 | 3.13 | 23 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yogesh S. Mahajan | 1 | 72 | 4.62 |
| Zhaohui Fu | 2 | 283 | 14.28 |
| Sharad Malik | 3 | 7766 | 691.24 |