| Project/Area Number |
15K16057
|
|---|
| Research Category |
Grant-in-Aid for Young Scientists (B)
|
| Allocation Type | Multi-year Fund |
|---|
| Research Field |
Intelligent informatics
|
|---|
| Research Institution | National Institute of Informatics |
|---|
Principal Investigator |
Sonobe Tomohiro 国立情報学研究所, ビッグデータ数理国際研究センター, 特任研究員 (50747269)
|
|---|
| Project Period (FY) |
2015-04-01 – 2017-03-31
|
| Project Status |
Completed (Fiscal Year 2016)
|
| Budget Amount *help |
¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2016: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2015: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
|
|---|
| Keywords | 充足可能性問題 / SATソルバ / 探索 / 並列 / グラフ |
|---|
| Outline of Final Research Achievements |
The Boolean satisfiability problem (SAT problem) is considered to be difficult to solve in an efficient manner. Because SAT problems are derived from real-world applications such as software and circuit verification, development of fast SAT solvers for solving SAT problems is important. In this research, we have developed parallel SAT solvers by using methods in graph theory. The developed solvers won prizes in the international SAT solver competitions.
|
