Computing Convex Hulls with a Linear Solver

Simple item page
dc.creatorBenoy, Florence
dc.creatorKing, Andy
dc.creatorMesnard, Fred
dc.date2003-11-04
dc.date.accessioned2026-07-07T03:20:32Z
dc.date.available2026-07-07T03:20:32Z
dc.descriptionA 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. To appear in Theory and Practice of Logic Programming (TPLP)
dc.description13 pages, 1 figure
dc.identifierhttps://arxiv.org/abs/cs/0311002
dc.identifierhttp://arxiv.org/abs/cs/0311002
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31859
dc.subjectProgramming Languages
dc.subjectD.1.6; F.3.2
dc.titleComputing Convex Hulls with a Linear Solver
dc.typetext

Files

Collections

arXiv