Computing Convex Hulls with a Linear Solver

Benoy, Florence, King, Andy, 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:10.1017/S1471068404002261) (KAR id:37639)

PDF Language: English
Download this file (PDF/12MB)
Request a format suitable for use with assistive technology e.g. a screenreader
Official URL: http://dx.doi.org/10.1017/S1471068404002261

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
DOI/Identification number:	10.1017/S1471068404002261
Subjects:	A General Works A General Works > AC Collections. Series. Collected works
Divisions:	Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User:	Andy King
Date Deposited:	16 Dec 2013 20:34 UTC
Last Modified:	16 Nov 2021 10:14 UTC
Resource URI:	https://kar.kent.ac.uk/id/eprint/37639 (The current URI for this page, for reference purposes)

University of Kent Author Information

King, Andy.

Creator's ORCID:	https://orcid.org/0000-0001-5806-4822
CReDIT Contributor Roles:

Depositors only (login required):

Altmetric

Download Statistics

Total unique views for this document in KAR since July 2020. For more details click on the image.