© University of Kent - Contact | Feedback | Legal
The University of Kent, Canterbury, Kent, CT2 7NZ, T +44 (0)1227 764000
Computing Convex Hulls with a Linear Solver
F. Benoy, A. King, and F. Mesnard
Theory and Practice of Logic Programming, 5(1&2):259-271, 2005 (Theory and Practice of Logic Programming was formally known as The Journal of Logic Programming, see http://www.cwi.nl/projects/alp/Welcome/appeal.html).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.
Download publication 344 kbytes (PostScript)Bibtex Record
@article{1734,
author = {F.~Benoy and A.~King and F.~Mesnard},
title = {{C}omputing {C}onvex {H}ulls with a {L}inear {S}olver},
month = {unknown},
year = {2005},
pages = {259-271},
keywords = {convex hull, polyhedra, abstract interpretation, linear constraints},
note = {(Theory and Practice of Logic Programming was formally known as The Journal of Logic Programming, see http://www.cwi.nl/projects/alp/Welcome/appeal.html).},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/2005/1734},
publication_type = {article},
submission_id = {22300_1066923833},
journal = {Theory and Practice of Logic Programming },
number = {1&2},
publisher = {Cambridge University Press},
volume = {5},
}