Showing cs.PLShow all
3 papers · 1 filter
cs.PL2001
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…
cs.PL2001
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…
cs.PL2000
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…