2 papers
cs.PL2003
Computing Convex Hulls with a Linear Solver
Florence Benoy, Andy King, Fred Mesnard
A programming tactic involving polyhedra is reported that has been widely applied in the polyhedral analysis of (constraint) logic programs. The method enables the computations of…
cs.PL2003
cTI: A constraint-based termination inference tool for ISO-Prolog
Fred Mesnard, Roberto Bagnara
We present cTI, the first system for universal left-termination inference of logic programs. Termination inference generalizes termination analysis and checking. Traditionally, a t…