Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
Reducing Search Space in Solving Higher-Order Equations
| |
|
Reducing Search Space in Solving Higher-Order Equations
Tetsuo Ida2  , Mircea Marin2 and Taro Suzuki3
| (2) |
Institute of Information Sciences and Electronics, University of Tsukuba, 305-8573 Tsukuba, Japan |
| (3) |
Department of Computer Software, University of Aizu, 965-8580 Aizu, Wakamatsu, Japan |
Abstract
We describe the results of our investigation of equational problem solving in higher-order setting. The main problem is identified
to be that of reducing the search space of higher-order lazy narrowing calculi, namely how to reduce the search space without
losing the completeness of the calculi. We present a higher-order calculus HOLN0 as a system of inference rules and discuss various refinements that enable the reduction of the search space by eliminating
some sources of nondeterminism inherent in the calculus.
This work has been also supported in part by JSPS Grant-in-Aid for Scientific Research (B) 12480066, 2000–2002, and (C) 13680388,
2001–2002. Mircea Marin has been supported by JSPS postdoc fellowship 00096, 2000–2001.
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|