2003 Fiscal Year Final Research Report Summary
Solving Constraint Satisfaction Problew by Using Dynamics Which Can Search State-Space Globally
| Project/Area Number |
14580383
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
計算機科学
|
|---|
| Research Institution | Kyushu Institute Of Technology |
|---|
Principal Investigator |
NAGAMATU Masahiro Kyushu Institute Of Technology, Graduate School of Life Science and Systems Engineering, Professor, 大学院・生命体工学研究科, 教授 (70117307)
|
|---|
| Project Period (FY) |
2002 – 2003
|
| Keywords | satisfiability problem / constraint satisfaction problem / neural network / Lagrangian method / global state-space search |
|---|
| Research Abstract |
For the satisfiability problem of propositional calculus (SAT), we have proposed a neural network dynamics called LPPH which is based on Lagrangian method. From experimental results it is known that this dynamics can find a solution more effectively than already proposed method. In this project, we investigate the following :
1)The LPPH is extended from a solver of the SAT to a solver of the more general constraint satisfaction problems. By experiments we show that this extension is effective. We also show the LPPH is suitable for massively parallel processing and hardware implementation.
2)To speedup the LPPH we proposed the following method : (1)reduction of the amount of computation based on the fact that at each time step only small number of variables change their values, and (2)giving different degree of importance for each type of constraint.
3)Application for automatic layout of UML class diagram.
4)Proposal of parallel execution of the LPPH.
5)Implementation of the LPPH by interconnection networks or electronic circuits.
|
Research Products
(10 results)
