7 citations · 11 across the 7 of their papers we have counts for
6 papers · 1 filter
Compiling Control as Offline Partial Deduction
Vincent Nys, Danny De Schreye
We present a new approach to a technique known as compiling control, whose aim is to compile away special mechanisms for non-standard atom selection in logic programs. It has previ…
Transforming Coroutining Logic Programs into Equivalent CHR Programs
Vincent Nys, Danny De Schreye
We extend a technique called Compiling Control. The technique transforms coroutining logic programs into logic programs that, when executed under the standard left-to-right selecti…
Termination Prediction for General Logic Programs
Yi-Dong Shen, Danny De Schreye, Dean Voets
We present a heuristic framework for attacking the undecidable termination problem of logic programs, as an alternative to current termination/non-termination proof approaches. We…
Inference of termination conditions for numerical loops
Alexander Serebrenik, Danny De Schreye
We present a new approach to termination analysis of numerical computations in logic programs. Traditional approaches fail to analyse them due to non well-foundedness of the intege…
Acceptability with general orderings
Danny De Schreye, Alexander Serebrenik
We present a new approach to termination analysis of logic programs. The essence of the approach is that we make use of general orderings (instead of level mappings), like it is do…
Termination analysis of logic programs using acceptability with general term orders
Alexander Serebrenik, Danny De Schreye
We present a new approach to termination analysis of logic programs. The essence of the approach is that we make use of general term-orderings (instead of level mappings), like it…