Accelerating All-SAT computation with short blocking clauses
The All-SAT (All-SATisfiable) problem focuses on finding all satisfiable assignments of a given propositional formula, whose applications include model checking, automata construction, and logic minimization. A typical ALL-SAT solver is normally based on iteratively computing satisfiable assignments...
Saved in:
| Main Authors: | , , |
|---|---|
| 格式: | text |
| 語言: | English |
| 出版: |
Institutional Knowledge at Singapore Management University
2020
|
| 主題: | |
| 在線閱讀: | https://ink.library.smu.edu.sg/sis_research/5944 https://ink.library.smu.edu.sg/context/sis_research/article/6947/viewcontent/ALL_SAT_av.pdf |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Singapore Management University |
| 語言: | English |