3 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.PL2002
Three Optimisations for Sharing
Jacob M. Howe, Andy King
In order to improve precision and efficiency sharing analysis should track both freeness and linearity. The abstract unification algorithms for these combined domains are suboptima…
cs.PL2002
Efficient Groundness Analysis in Prolog
Jacob M. Howe, Andy King
Boolean functions can be used to express the groundness of, and trace grounding dependencies between, program variables in (constraint) logic programs. In this paper, a variety of…