2 papers
cs.PL2000
A Polyvariant Binding-Time Analysis for Off-line Partial Deduction
Maurice Bruynooghe, Michael Leuschel, Konstantinos Sagonas
We study the notion of binding-time analysis for logic programs. We formalise the unfolding aspect of an on-line partial deduction system as a Prolog program. Using abstract interp…
cs.LO2000
Termination Proofs for Logic Programs with Tabling
Sofie Verbaeten, Danny De Schreye, Konstantinos Sagonas
Tabled logic programming is receiving increasing attention in the Logic Programming community. It avoids many of the shortcomings of SLD execution and provides a more flexible and…