2000 Fiscal Year Final Research Report Summary
New Constraint Solving Algorithms for Drawing Systems
| Project/Area Number |
11680346
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
計算機科学
|
|---|
| Research Institution | Tokyo Institute of Technology, Department of Computer Science |
|---|
Principal Investigator |
TOKUDA Takehiro Tokyo Institute of Technology, Department of Computer Science, Prof., 大学院・情報理工学研究科, 教授 (30111644)
|
|---|
| Project Period (FY) |
1999 – 2000
|
| Keywords | Constraint Solving Algorithm / DeltaBlue / Extended DeltaBlue / DeltaUp / Hierarchical DeltaBlue / Modified Indigo |
|---|
| Research Abstract |
From 1999 to 2000 we achieved the following results of our constraint programming research.
In 1999 we developed three types of modified DeltaBlue constraint solving algorithms : Namely, Extended DeltaBlue, DeltaUp, and Hierarchical DeltaBlue. Extended DeltaBlue can safely solve an extended class of constraint problems of DeltaBlue. DeltaUp always performs the smallest number of method reselections. Hierarchical DeltaBlue can use module constraints when we deal with large scale constraint problems.
In 2000 we developed a modified Indigo constraint solving algorithm which can deal with constraint problems with circular constraints consisting of equality and inequality constraints. We designed two constraint programming environments, Constraint Tcl/Tk system based on Tcl/Tk and Constraint Pascal system based on Pascal. We also implemented Constraint Tcl/Tk system.
Thus we developed four constraint solving algorithms and one constraint programming environment.
|
