School of Computing

Computing Convex Hulls with a Linear Solver

F. Benoy, A. King, and F. Mesnard

Technical Report 11-02, University of Kent, Computing Laboratory, September 2002 This paper is under revision as it is accepted conditionally for publication in Theory and Practise of Logic Programming.

Abstract

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.

Download publication 237 kbytes (PostScript)

Bibtex Record

@techreport{1561,
author = {F.~Benoy and A.~King and F.~Mesnard},
title = {{C}omputing {C}onvex {H}ulls with a {L}inear {S}olver},
month = {September},
year = {2002},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {This paper is under revision as it is accepted conditionally for publication in Theory and Practise of Logic Programming},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/2002/1561},
    publication_type = {techreport},
    submission_id = {4018_1037978890},
    number = {11-02},
    institution = {University of Kent, Computing Laboratory},
}

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 21/03/2014