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)
|
Download (685kB)
Preview
Download (685kB)
|
|
|
| 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: | Faculties > Sciences > School of Computing > Programming Languages and Systems Group |
| Depositing User: | Andy King |
| Date Deposited: | 16 Dec 2013 20:34 UTC |
| Last Modified: | 15 Feb 2020 04:05 UTC |
| Resource URI: | https://kar.kent.ac.uk/id/eprint/37639 (The current URI for this page, for reference purposes) |
| King, Andy: |  https://orcid.org/0000-0001-5806-4822 |
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):
Altmetric
Altmetric