Sciweavers

JFLP
2002

Complete Selection Functions for a Lazy Conditional Narrowing Calculus

13 years 11 months ago
Complete Selection Functions for a Lazy Conditional Narrowing Calculus
In this paper we extend the lazy narrowing calculus lnc of Middeldorp, Okui, and Ida [26] to conditional rewrite systems. The resulting lazy conditional narrowing calculus lcnc is highly non-deterministic. We investigate for which classes of conditional rewrite systems the completeness of lcnc is ensured. In order to improve the efficiency of the calculus, we pay special attention to the removal of non-determinism due to the selection of equations in goals by fixing a selection strategy. 1
Aart Middeldorp, Taro Suzuki, Mohamed Hamada
Added 22 Dec 2010
Updated 22 Dec 2010
Type Journal
Year 2002
Where JFLP
Authors Aart Middeldorp, Taro Suzuki, Mohamed Hamada
Comments (0)