A Study of Term Matching in the Equational Language Processor
| Project/Area Number |
01550282
|
|---|
| Research Category |
Grant-in-Aid for General Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Research Field |
計算機工学
|
|---|
| Research Institution | Nagoya University |
|---|
Principal Investigator |
HIRATA Tomio Nagoya University, Faculty of Engineering, Associate Professor, 工学部, 助教授 (10144205)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
SAKABE Toshiki Nagoya University, Faculty of Engineering, Associate Professor, 工学部, 助教授 (60111829)
INAGAKI Yasuyoshi Nagoya University, Faculty of Engineering, Professor, 工学部, 教授 (10023079)
|
|---|
| Project Period (FY) |
1989 – 1990
|
| Project Status |
Completed (Fiscal Year 1990)
|
| Budget Amount *help |
¥1,400,000 (Direct Cost: ¥1,400,000)
Fiscal Year 1990: ¥600,000 (Direct Cost: ¥600,000)
Fiscal Year 1989: ¥800,000 (Direct Cost: ¥800,000)
|
|---|
| Keywords | Equational language / Term matching / Tree pattern matching |
|---|
| Research Abstract |
The purpose of this research is to develop algorithms and data structure for efficient term matching and rewriting. The results obtained are as follows.
1. We propose three algorithms for tree-pattern matching. By preprocessing the pattern, the first one performs efficient matching. The second one is very efficient when the pattern contains few variables. The last one is a parallel algorithm based on a systolic array.
2. We design an efficient parallel algorithm on PRAM. The algorithm runs in O (log n) time using (mn/log n) processors, where m and n are sizes of input pattern and text, respectively.
3. We investigate implementation methods of the parallel outermost rewriting strategy in TRS.
4. We published the above results as a research report.
|
Report
(3 results)
Research Products
(15 results)
