Benoy, Florence and King, A. and Mesnard, F. (2002) Computing Convex Hulls with a Linear Solver. Technical report. Computing Laboratory, University of Kent, Canterbury, CT2 7NF, UK.
A programming tactic involving polyhedra is reported that has been widely used in the analysis of logic programs. The method enables the convex hull operation to be coded with linear constraint solving machinery that is available in many Prolog systems.
|Item Type:||Monograph (Technical report)|
|Additional information:||This paper is under revision as it is accepted conditionally for publication in Theory and Practise of Logic Programming|
|Subjects:||Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,|
|Divisions:||Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group|
|Depositing User:||Mark Wheadon|
|Date Deposited:||24 Nov 2008 17:59|
|Last Modified:||06 Sep 2011 01:15|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/13744 (The current URI for this page, for reference purposes)|
- Depositors only (login required):