Computing Convex Hulls with a Linear Solver

Benoy, Florence and King, Andy and Mesnard, Fred (2005) Computing Convex Hulls with a Linear Solver. Theory and Practice of Logic Programming, 5 (1-2). pp. 259-271. ISSN 1471-0684. (doi:https://doi.org/10.1017/S1471068404002261) (Full text available)

Abstract

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 convex hulls that are required for polyhedral analysis to be coded with linear constraint solving machinery that is available in many Prolog systems.

Item Type:	Article
Subjects:	A General Works A General Works > AC Collections. Series. Collected works
Divisions:	Faculties > Sciences > School of Computing > Programming Languages and Systems Group
Depositing User:	Andy King
Date Deposited:	16 Dec 2013 20:34 UTC
Last Modified:	03 Jul 2014 13:33 UTC
Resource URI:	https://kar.kent.ac.uk/id/eprint/37639 (The current URI for this page, for reference purposes)