Completeness Results for a Lazy Conditional Narrowing Calculus
Mohamed Hamada, Aart Middeldorp, and Taro Suzuki
Proceedings of the 2nd Discrete Mathematics and Theoretical Computer
Science Conference and the 5th Australasian Theory Symposium
(DMTCS/CATS 1999), Springer-Verlag Singapore, pp. 217 – 231, 1999
Abstract
We present two new completeness results for the lazy conditional narrowing calculus LCNC: LCNC is complete for arbitrary confluent conditional rewrite systems without extra variables with respect to normalized solutions and for terminating and level-confluent conditional rewrite systems without any restrictions on the distribution of variables in the rewrite rules.BibTeX Entry
@inproceedings{HMS-DMTCS99,
author = "Mohamed Hamada and Aart Middeldorp and Taro Suzuki",
title = "Completeness Results for a Lazy Conditional Narrowing
Calculus",
booktitle = "Combinatorics, Computation and Logic: Proceedings of the 2nd
Discrete Mathematics and Theoretical Computer Science
Conference and the 5th Australasian Theory Symposium",
publisher = "Springer-Verlag Singapore",
pages = "217--231",
year = 1999
}