Name
Abstract | ||
|---|---|---|
We introduce a new approach to Boolean satisfiability (SAT) that combines backtrack search techniques and zero-suppressed binary decision diagrams (ZBDDs). This approach implicitly represents SAT instances using ZBDDs, and performs search using an efficient implementation of unit propagation on the ZBDD structure. The adaptation of backtrack search algorithms to such an implicit representation allows for a potential exponential increase in the size of problems that can be handled |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1109/DATE.2002.998438 | Paris |
Keywords | Field | DocType |
Boolean algebra,backtracking,binary decision diagrams,computability,data structures,database theory,Boolean satisfiability,Davis-Logemann-Loveland backtrack-search procedure,ZBDD structure,backtrack search techniques,clause database,fixed variable decision order,search-based SAT,unit propagation,zero-suppressed BDDs,zero-suppressed binary decision diagrams | Boolean function,Search algorithm,Computer science,Boolean satisfiability problem,Algorithm,Binary decision diagram,Theoretical computer science,Computability,Boolean algebra,Unit propagation,Backtracking | Conference |
ISSN | ISBN | Citations |
1530-1591 | 0-7695-1471-5 | 0 |
PageRank | References | Authors |
0.34 | 2 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Aloul, F.A. | 1 | 229 | 12.52 |
| Maher N. Mneimneh | 2 | 212 | 11.34 |
| Karem A. Sakallah | 3 | 3314 | 287.44 |