Abstract

In this paper we extend the lazy narrowing calculus LNC of Middeldorp, Okui, and Ida (TCS 1996) 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.

BibTeX Entry

@article{MSH-JFLP02,
 author      = "Aart Middeldorp and Taro Suzuki and Mohamed Hamada",
 title       = "Complete Selection Functions for a Lazy Conditional
                Narrowing Calculus",
 journal     = "Journal of Functional and Logic Programming",
 volume      = 2002,
 number      = 3,
 year        = 2002
}