activity
20022008
most citedA Non-Termination Criterion for Binary Constraint Logic Programs

1 citations · 1 across the 4 of their papers we have counts for

collaborators
Showing 2005 · cs.PLShow all

1 paper · 2 filters

cs.PL2005

An Improved Non-Termination Criterion for Binary Constraint Logic Programs

Etienne Payet, Fred Mesnard

On one hand, termination analysis of logic programs is now a fairly established research topic within the logic programming community. On the other hand, non-termination analysis s…