Computing convex hulls with a linear solver

Authors:
Florence Benoy;Andy King;Fred Mesnard
Affiliations:
Computing Laboratory, University of Kent, Canterbury, Kent, UK (e-mail: p.m.benoy@kent.ac.uk, a.m.king@kent.ac.uk;Computing Laboratory, University of Kent, Canterbury, Kent, UK (e-mail: p.m.benoy@kent.ac.uk, a.m.king@kent.ac.uk;Iremia, Université de La Réunion, France (e-mail: fred@univ-reunion.fr)
Venue:
Theory and Practice of Logic Programming
Year:
2005

Citing 8
Cited 5

A CLP language handling disjunctions of linear constraints

ICLP'93 Proceedings of the tenth international conference on logic programming on Logic programming
Prolog: the standard: reference manual

Prolog: the standard: reference manual
Lower-bound time-complexity analysis of logic programs

ILPS '97 Proceedings of the 1997 international symposium on Logic programming
Parameterized polyhedra and their vertices

International Journal of Parallel Programming
Automatic discovery of linear restraints among variables of a program

POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Higher-Precision Groundness Analysis

Proceedings of the 17th International Conference on Logic Programming
Inferring Argument Size Relationships with CLP(R)

LOPSTR '96 Proceedings of the 6th International Workshop on Logic Programming Synthesis and Transformation
Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library

SAS '02 Proceedings of the 9th International Symposium on Static Analysis

Size invariant and ranking function synthesis in a functional language

WFLP'11 Proceedings of the 20th international conference on Functional and constraint logic programming
Fully automatic binding-time analysis for prolog

LOPSTR'04 Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation
Exploiting sparsity in polyhedral analysis

SAS'05 Proceedings of the 12th international conference on Static Analysis
Fast and accurate strong termination analysis with an application to partial evaluation

WFLP'09 Proceedings of the 18th international conference on Functional and Constraint Logic Programming
Applying abstract acceleration to (co-)reachability analysis of reactive programs

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

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.