Sciweavers

FLOPS
2008
Springer
14 years 1 months ago
A Generalization of the Folding Rule for the Clark-Kunen Semantics
Abstract. In this paper, we propose more flexible applicability conditions for the folding rule that increase the power of existing unfold/fold systems for normal logic programs. O...
Javier Álvez, Paqui Lucio
LOPSTR
1994
Springer
14 years 3 months ago
A Transformation System for Definite Programs Based on Termination Analysis
We present a goal replacement rule whose main applicability condition is based on termination properties of the resulting transformed program. The goal replacement rule together wi...
J. Cook, John P. Gallagher